Submission #1518376
Source Code Expand
#include<bits/stdc++.h>
#define X first
#define Y second
#define FOR(i, l, r) for(int i = int(l); i <= int(r); ++i)
#define FORD(i, l, r) for(int i = int(l); i >= int(r); --i)
#define REP(i, r) for(int i = 0; i < int(r); ++i)
#define REPD(i, l) for(int i = int(l)-1; i >= 0; --i)
#define mk make_pair
#define sz size
#define DEBUG(x) {cerr << #x << " = " << x << '\n';}
#define PR(A, n) {cerr << #A << " = "; FOR(i, 1, n) cerr << A[i] << ' '; cerr << '\n';}
#define PR0(A, n) {cerr << #A << " = "; REP(i, n) cerr << A[i] << ' '; cerr << '\n';}
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
const int Nmax = 3*1e5 + 100;
template<class T> int getbit(T x, int pos) {return (x >> (pos-1)) & 1;}
template<class T> void turn_on(T &x, int pos) {x = x | ((T)1 << (pos-1));}
template<class T> void turn_off(T &x, int pos) {x = x & ~((T)1 << (pos-1));}
template<class T> T sqr(T a) {return a*a;}
ll n, a[Nmax], Mx[Nmax], Mn[Nmax], sum, ans = -1;
priority_queue<ll, vi, greater<ll> > pmin;
priority_queue<ll> pmax;
int main() {
//freopen("in.txt", "r", stdin);
//freopen(".out", "w", stdout);
scanf("%I64d", &n);
FOR(i, 1, 3*n) scanf("%I64d", &a[i]);
FOR(i, 1, 2*n) {
if (pmin.size() < n) {
pmin.push(a[i]);
sum += a[i];
} else if (pmin.size() == n && pmin.top() < a[i]) {
sum = sum - pmin.top() + a[i];
pmin.pop();
pmin.push(a[i]);
}
Mx[i] = sum;
}
sum = 0;
FORD(i, 3*n, n) {
if (pmax.size() < n) {
pmax.push(a[i]);
sum += a[i];
} else if (pmax.size() == n && pmax.top() > a[i]) {
sum = sum - pmax.top() + a[i];
pmax.pop();
pmax.push(a[i]);
}
Mn[i] = sum;
}
//FOR(i, 2*n, 3*n) cout << Mn[i] << ' ';
FOR(i, n, 2*n) {
ans = max(Mx[i] - Mn[i+1], ans);
}
cout << ans;
}
Submission Info
Submission Time
2017-08-18 12:01:25+0900
Task
D - 3N Numbers
User
tuhi
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
2037 Byte
Status
WA
Exec Time
187 ms
Memory
8180 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:32:22: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘ll* {aka long long int*}’ [-Wformat=]
scanf("%I64d", &n);
^
./Main.cpp:33:40: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘ll* {aka long long int*}’ [-Wformat=]
FOR(i, 1, 3*n) scanf("%I64d", &a[i]);
^
./Main.cpp:32:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%I64d", &n);
^
./Main.cpp:33:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
FOR(i, 1, 3*n) scanf("%I64d", &a[i]);
^
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
AC
3 ms
4480 KB
0_01.txt
AC
2 ms
4352 KB
0_02.txt
AC
2 ms
4352 KB
1_00.txt
AC
2 ms
4352 KB
1_01.txt
AC
2 ms
4352 KB
1_02.txt
WA
2 ms
4352 KB
1_03.txt
AC
2 ms
4352 KB
1_04.txt
AC
2 ms
4352 KB
1_05.txt
AC
2 ms
4352 KB
1_06.txt
AC
2 ms
4352 KB
1_07.txt
AC
2 ms
4352 KB
1_08.txt
AC
3 ms
4352 KB
1_09.txt
AC
3 ms
4352 KB
1_10.txt
WA
3 ms
4352 KB
1_11.txt
AC
3 ms
4352 KB
1_12.txt
AC
3 ms
4352 KB
1_13.txt
AC
3 ms
4352 KB
1_14.txt
AC
3 ms
4352 KB
1_15.txt
AC
3 ms
4352 KB
1_16.txt
AC
3 ms
4352 KB
1_17.txt
AC
3 ms
4352 KB
1_18.txt
AC
3 ms
4352 KB
1_19.txt
AC
3 ms
4352 KB
1_20.txt
AC
4 ms
4352 KB
1_21.txt
AC
4 ms
4352 KB
1_22.txt
AC
4 ms
4352 KB
1_23.txt
AC
4 ms
4352 KB
2_00.txt
AC
56 ms
8180 KB
2_01.txt
AC
81 ms
8180 KB
2_02.txt
WA
84 ms
8180 KB
2_03.txt
AC
79 ms
8180 KB
2_04.txt
AC
78 ms
8180 KB
2_05.txt
AC
79 ms
8180 KB
2_06.txt
AC
78 ms
8180 KB
2_07.txt
AC
74 ms
8180 KB
2_08.txt
AC
63 ms
8180 KB
2_09.txt
AC
63 ms
8180 KB
2_10.txt
AC
64 ms
8180 KB
2_11.txt
AC
62 ms
8180 KB
2_12.txt
AC
185 ms
8180 KB
2_13.txt
AC
187 ms
8180 KB
2_14.txt
AC
187 ms
8180 KB
2_15.txt
AC
187 ms
8180 KB