# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
800435 | 2023-08-01T14:54:16 Z | vjudge1 | Candies (JOI18_candies) | C++17 | 2 ms | 596 KB |
#include <bits/stdc++.h> using namespace std; #define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0); #define rall(s) s.rbegin(),s.rend() #define all(s) s.begin(),s.end() #define pb push_back #define fi first #define se second #define ll long long #define ld long double #define YES cout<<"YES\n" #define Yes cout<<"Yes\n" #define yes cout<<"yes\n" #define NO cout<<"NO\n" #define No cout<<"No\n" #define no cout<<"no\n" const int N = 2e5 + 9 , mod = 1e9 + 7; ll d[N] = {} , a[N] = {}, dp[N][2] = {}, b[N] ,c[N] , sq = 310; multiset<pair<ll,pair<ll,ll>>>st , st1; void del(int x , int y , int z){ st1.erase({x ,{y , z}}); st.erase({z ,{x , y}}); } void add(int x , int y , int z){ st1.insert({x ,{y , z}}); st.insert({z ,{x , y}}); } void solve(){ ll q , i , j , m , n, z , s = 0, f, l , r , k , x = 0 , y , mn = 1e18 , mx = -1; cin>>n; for(i = 1; i <= n; i++){ cin>>a[i]; dp[i][0] = dp[i - 1][0]; dp[i][1] = dp[i - 1][1]; dp[i][i % 2] += a[i]; st.insert({a[i] ,{i , i}}); st1.insert({i , {i , a[i]}}); } l = 1 , r = n , s = 0; for(i = 1; i <= (n + 1) / 2; i++){ auto it = st.rbegin(); s += it->fi; z = it->fi , x = it->se.fi , y = it->se.se; del(x , y , z); cout<<s<<"\n"; if(x == l || y == r){ if(x == l){ auto it1 = st1.lower_bound({y, {-1 , -1}}); if(st1.size() && it1 != st1.end()) y = it1->se.fi , del(it1->fi , it1->se.fi,it1->se.se); l = y + 1; } if(y == r){ auto it1 = st1.lower_bound({y , {-1 , -1}}); if(st1.size() && it1 != st1.begin()){ it1--; x = it1->fi; del(it1->fi , it1->se.fi , it1->se.se); } r = x - 1; } continue; } auto it1 = st1.lower_bound({y , {-1 , -1}}); if(st1.size() && it1 != st1.end()){ y = it1->se.fi; del(it1->fi , it1->se.fi , it1->se.se); } it1 = st1.lower_bound({y , {-1 , -1}}); if(st1.size() && it1 != st1.begin()){ it1--; x = it1->fi; del(it1->fi , it1->se.fi , it1->se.se); } add(x , y , dp[y][x%2] - dp[x - 1][x%2] - (dp[y][1 - (x%2)] - dp[x - 1][1 - (x % 2)] )); } } int main(){ TL; /*#ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif */ int t = 1; //cin>>t; while(t--) { solve(); } } // Author : حسن
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 596 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 596 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |