Submission #1726128
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define REP(i,n) for(int i=0;i<n;++i) #define SORT(name) sort(name.begin(), name.end()) #define ZERO(p) memset(p, 0, sizeof(p)) #define MINUS(p) memset(p, -1, sizeof(p)) #if 1 # define DBG(fmt, ...) printf(fmt, __VA_ARGS__) #else # define DBG(fmt, ...) #endif #define MOD 1000000007 #define INF 1000000000 #define MAX_N 100010 ll W, H; vector<ll> P, Q; int main() { ll ans = 0; ll edge = 0; cin >> W >> H; REP(i, W) { ll tmp; cin >> tmp; P.push_back(tmp); ans += tmp; edge++; } REP(i, H) { ll tmp; cin >> tmp; Q.push_back(tmp); ans += tmp; edge++; } //printf("ans: %lld\n", ans); //printf("edge: %lld\n", edge); SORT(P); SORT(Q); ll p_ind = 0, q_ind = 0; while(edge < (W+1) * (H+1) - 1) { if(P[p_ind] < Q[q_ind]) { ans += (H - q_ind) * P[p_ind]; //printf("P[%lld]: %lld\n", p_ind, P[p_ind]); p_ind++; edge += (H - q_ind >= 0) ? (H - q_ind) : 0; } else { ans += (W - p_ind) * Q[q_ind]; //printf("Q[%lld]: %lld\n", q_ind, Q[q_ind]); q_ind++; edge += (W - p_ind >= 0) ? (W - p_ind) : 0; } } printf("%lld\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Gr-idian MST |
User | VTR |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1424 Byte |
Status | AC |
Exec Time | 94 ms |
Memory | 2548 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 89 ms | 2548 KB |
02.txt | AC | 88 ms | 2548 KB |
03.txt | AC | 89 ms | 2548 KB |
04.txt | AC | 88 ms | 2548 KB |
05.txt | AC | 89 ms | 2548 KB |
06.txt | AC | 91 ms | 2548 KB |
07.txt | AC | 90 ms | 2548 KB |
08.txt | AC | 89 ms | 2548 KB |
09.txt | AC | 89 ms | 2548 KB |
10.txt | AC | 89 ms | 2548 KB |
11.txt | AC | 87 ms | 2548 KB |
12.txt | AC | 94 ms | 2548 KB |
13.txt | AC | 79 ms | 2548 KB |
14.txt | AC | 88 ms | 2548 KB |
15.txt | AC | 88 ms | 2548 KB |
16.txt | AC | 45 ms | 1400 KB |
17.txt | AC | 44 ms | 1400 KB |
18.txt | AC | 44 ms | 1400 KB |
19.txt | AC | 45 ms | 1400 KB |
20.txt | AC | 36 ms | 2548 KB |
21.txt | AC | 62 ms | 2548 KB |
22.txt | AC | 62 ms | 2548 KB |
23.txt | AC | 61 ms | 2548 KB |
24.txt | AC | 84 ms | 2548 KB |
25.txt | AC | 1 ms | 256 KB |
26.txt | AC | 1 ms | 256 KB |
27.txt | AC | 1 ms | 256 KB |
28.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |