oj.uz

답안 #152467

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152467 2019-09-08T04:38:34 Z cheetose Candies (JOI18_candies) C++11
100 / 100
 793 ms 24312 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

int n;
ll d[200000];
struct cmp {
    bool operator ()(int i, int j){return d[i]>d[j] || (d[i]==d[j] && i<j);};
};
set<int,cmp> S1;
set<int> S2;
int main() {
	scanf("%d",&n);
	fup(i,0,n-1,1)
	{
		scanf("%lld",d+i);
		S1.insert(i);S2.insert(i);
	}
	ll ans=0;
	fup(k,1,(n+1)/2,1)
	{
		assert(!S1.empty());
		int i=*S1.begin();
		S1.erase(S1.begin());S2.erase(i);
		ans+=d[i];
		printf("%lld\n",ans);
		d[i]=-d[i];
		bool ok=1;
		auto l=S2.upper_bound(i);
		auto r=l;
		if(l!=S2.begin())
		{
			l--;
			d[i]+=d[*l];
			S1.erase(*l);
			S2.erase(l);
		}
		else ok=0;
		if(r!=S2.end())
		{
			d[i]+=d[*r];
			S1.erase(*r);
			S2.erase(r);
		}
		else ok=0;
		if(ok)
		{
			S1.insert(i);
			S2.insert(i);
		}
	}
}

Compilation message

candies.cpp: In function 'int main()':
candies.cpp:71:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
candies.cpp:74:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",d+i);
   ~~~~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 4 ms 508 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 4 ms 504 KB Output is correct
8 Correct 4 ms 504 KB Output is correct
9 Correct 4 ms 504 KB Output is correct
10 Correct 4 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 632 KB Output is correct
13 Correct 4 ms 508 KB Output is correct
14 Correct 4 ms 632 KB Output is correct
15 Correct 4 ms 504 KB Output is correct
16 Correct 4 ms 540 KB Output is correct
17 Correct 4 ms 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 4 ms 504 KB Output is correct
20 Correct 4 ms 504 KB Output is correct

Subtask #2
92.0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 4 ms 508 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 4 ms 504 KB Output is correct
8 Correct 4 ms 504 KB Output is correct
9 Correct 4 ms 504 KB Output is correct
10 Correct 4 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 632 KB Output is correct
13 Correct 4 ms 508 KB Output is correct
14 Correct 4 ms 632 KB Output is correct
15 Correct 4 ms 504 KB Output is correct
16 Correct 4 ms 540 KB Output is correct
17 Correct 4 ms 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 4 ms 504 KB Output is correct
20 Correct 4 ms 504 KB Output is correct
21 Correct 765 ms 24120 KB Output is correct
22 Correct 747 ms 24100 KB Output is correct
23 Correct 752 ms 24056 KB Output is correct
24 Correct 324 ms 23928 KB Output is correct
25 Correct 332 ms 23936 KB Output is correct
26 Correct 319 ms 24056 KB Output is correct
27 Correct 324 ms 24096 KB Output is correct
28 Correct 324 ms 24068 KB Output is correct
29 Correct 329 ms 24104 KB Output is correct
30 Correct 339 ms 24028 KB Output is correct
31 Correct 342 ms 24104 KB Output is correct
32 Correct 336 ms 24124 KB Output is correct
33 Correct 496 ms 23892 KB Output is correct
34 Correct 503 ms 23956 KB Output is correct
35 Correct 494 ms 24088 KB Output is correct
36 Correct 793 ms 24188 KB Output is correct
37 Correct 721 ms 24312 KB Output is correct
38 Correct 748 ms 24188 KB Output is correct
39 Correct 324 ms 24052 KB Output is correct
40 Correct 318 ms 24080 KB Output is correct
41 Correct 325 ms 23948 KB Output is correct
42 Correct 330 ms 24084 KB Output is correct
43 Correct 329 ms 24220 KB Output is correct
44 Correct 323 ms 24168 KB Output is correct
45 Correct 349 ms 24312 KB Output is correct
46 Correct 344 ms 24156 KB Output is correct
47 Correct 347 ms 24248 KB Output is correct
48 Correct 535 ms 23876 KB Output is correct
49 Correct 501 ms 23956 KB Output is correct
50 Correct 503 ms 23920 KB Output is correct