oj.uz

답안 #152461

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152461 2019-09-08T04:20:03 Z cheetose Candies (JOI18_candies) C++11
0 / 100
 5000 ms 632 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[100000];
struct cmp {
    bool operator ()(int i, int j){return d[i]>d[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)
	{
		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
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Execution timed out 5085 ms 504 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Execution timed out 5085 ms 504 KB Time limit exceeded
4 Halted 0 ms 0 KB -