Submission #1869328
Source Code Expand
#include <iostream> #include <iomanip> #include <string> #include <vector> #include <algorithm> #include <numeric> #include <map> #include <set> #include <queue> #include <stack> #include <cstdio> #include <cstring> #include <cmath> #include <bitset> #include <climits> #define REP(i,n) for (int i=0;i<(n);i++) #define FOR(i,a,b) for (int i=(a);i<(b);i++) #define RREP(i,n) for (int i=(n)-1;i>=0;i--) #define RFOR(i,a,b) for (int i=(a)-1;i>=(b);i--) #define ll long long #define ull unsigned long long int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; const int INF = 1e9; const ll LL_INF = 1e18; const int MOD = 1e9 + 7; using namespace std; ll aMax[100005]; ll aMin[100005]; int main(){ cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; vector<int> a(3*N); REP(i,3*N){ cin >> a[i]; } priority_queue<int, vector<int>, greater<int>> maxque; priority_queue<int> minque; REP(i,N){ maxque.push(a[i]); minque.push(a[i+2*N]); aMax[0] += a[i]; aMin[0] += a[i+2*N]; } REP(i,N){ int mi = maxque.top(); maxque.pop(); aMax[i + 1] = aMax[i] - mi + a[N+i]; maxque.push(a[N+i]); int ma = minque.top(); minque.pop(); aMin[i + 1] = aMin[i] - ma + a[2*N-i-1]; minque.push(a[2*N-i-1]); } ll ans = -1e18; REP(i,N + 1){ cout << aMax[i] - aMin[N - i] << endl; ans = max(ans, aMax[i] - aMin[N - i]); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 3N Numbers |
User | llll_ |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1492 Byte |
Status | WA |
Exec Time | 208 ms |
Memory | 5620 KB |
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | 0 / 200 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt |
Subtask | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | WA | 1 ms | 256 KB |
0_01.txt | WA | 1 ms | 256 KB |
0_02.txt | WA | 1 ms | 256 KB |
1_00.txt | WA | 1 ms | 256 KB |
1_01.txt | WA | 1 ms | 256 KB |
1_02.txt | WA | 1 ms | 256 KB |
1_03.txt | WA | 1 ms | 256 KB |
1_04.txt | WA | 1 ms | 256 KB |
1_05.txt | WA | 1 ms | 256 KB |
1_06.txt | WA | 1 ms | 256 KB |
1_07.txt | WA | 1 ms | 256 KB |
1_08.txt | WA | 3 ms | 256 KB |
1_09.txt | WA | 3 ms | 256 KB |
1_10.txt | WA | 3 ms | 384 KB |
1_11.txt | WA | 3 ms | 384 KB |
1_12.txt | WA | 3 ms | 384 KB |
1_13.txt | WA | 3 ms | 384 KB |
1_14.txt | WA | 3 ms | 384 KB |
1_15.txt | WA | 3 ms | 384 KB |
1_16.txt | WA | 3 ms | 256 KB |
1_17.txt | WA | 3 ms | 256 KB |
1_18.txt | WA | 3 ms | 256 KB |
1_19.txt | WA | 3 ms | 256 KB |
1_20.txt | WA | 3 ms | 384 KB |
1_21.txt | WA | 3 ms | 384 KB |
1_22.txt | WA | 3 ms | 384 KB |
1_23.txt | WA | 3 ms | 384 KB |
2_00.txt | WA | 180 ms | 4212 KB |
2_01.txt | WA | 196 ms | 4212 KB |
2_02.txt | WA | 193 ms | 5620 KB |
2_03.txt | WA | 194 ms | 5492 KB |
2_04.txt | WA | 191 ms | 5492 KB |
2_05.txt | WA | 192 ms | 5492 KB |
2_06.txt | WA | 193 ms | 5492 KB |
2_07.txt | WA | 195 ms | 5492 KB |
2_08.txt | WA | 179 ms | 4468 KB |
2_09.txt | WA | 178 ms | 4468 KB |
2_10.txt | WA | 182 ms | 4596 KB |
2_11.txt | WA | 180 ms | 4468 KB |
2_12.txt | WA | 207 ms | 5364 KB |
2_13.txt | WA | 208 ms | 5492 KB |
2_14.txt | WA | 207 ms | 5492 KB |
2_15.txt | WA | 206 ms | 5492 KB |