oj.uz

답안 #242874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
242874 2020-06-29T14:49:06 Z AmineWeslati Feast (NOI19_feast) C++14
100 / 100
 537 ms 22444 KB 
//Never stop trying
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()

using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0}; //right left down up

int32_t main(){
   boost;
   int N,K; cin>>N>>K;
   int t[N];
   for(int i=0; i<N; i++) cin>>t[i];

   set <pi> s;
   set <pi> ss;
   int cnt=0;
   for(int i=0; i<N; i++){
      int sg; if(t[i]<0) sg=-1; else sg=1;
      bool no=false;
      if(i==0 && sg==-1) no=true;
      int sum=0;
      while(i<N && t[i]*sg>=0){sum+=t[i]; i++;} i--;
      if(i==N-1 && sum<0) no=true;
      if(no) continue;

      s.insert({cnt,sum});
      ss.insert({abs(sum),cnt});
      cnt++;
   }

   //for(auto x: s) cout << x.se << ' '; cout << endl;

   while(sz(s)/2+1>K){



      auto it=ss.begin();
      pi pos=(*it);
      swap(pos.fi,pos.se);
      if(!s.count(pos)) pos.se=-pos.se;
      //cout << pos.se << endl;
      auto itr=s.find(pos);

      pi l={-1,-1},r={-1,-1};
      if(itr!=s.begin()){
         //cout << "beggg" << endl;
         itr--;
         l=(*itr);
         itr++;
      }
      auto itrr=s.end(); itrr--;
      if(itr!=itrr){
         //cout << "nd" << endl;
         itr++;
         r=(*itr);
      }
      //cout << l.fi << ' ' << l.se << ' ' << r.fi << ' ' << r.se << ' ' << pos.fi << ' ' << pos.se << endl;
      s.erase(pos); s.erase(l); s.erase(r);
      ss.erase({abs(pos.se),pos.fi}); ss.erase({abs(l.se),l.fi}); ss.erase({abs(r.se),r.fi});
      int sum=pos.se;
      if(l.se!=-1) sum+=l.se;
      if(r.se!=-1) sum+=r.se;
      s.insert({pos.fi,sum});ss.insert({abs(sum),pos.fi});

      auto itt=s.begin();
      if((*itt).se<0){s.erase(itt); ss.erase({abs((*itt).se),(*itt).fi});}
      itt=s.end(); itt--; if((*itt).se<0) {s.erase(itt); ss.erase({abs((*itt).se),(*itt).fi});}

      //for(auto x: s) cout << x.se << ' '; cout << endl;
      //break;
   }
   //for(auto x: s) cout << x.se << ' ';

   int res=0;
   for(auto x: s) if(x.se>0) res+=x.se;
   cout << res << endl;


   return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 2680 KB Output is correct
2 Correct 45 ms 2680 KB Output is correct
3 Correct 51 ms 2808 KB Output is correct
4 Correct 52 ms 2808 KB Output is correct
5 Correct 50 ms 2808 KB Output is correct
6 Correct 44 ms 2680 KB Output is correct
7 Correct 44 ms 2680 KB Output is correct
8 Correct 44 ms 2808 KB Output is correct
9 Correct 45 ms 2680 KB Output is correct
10 Correct 46 ms 2808 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 2688 KB Output is correct
2 Correct 26 ms 2816 KB Output is correct
3 Correct 27 ms 2816 KB Output is correct
4 Correct 28 ms 2816 KB Output is correct
5 Correct 47 ms 2688 KB Output is correct
6 Correct 27 ms 2688 KB Output is correct
7 Correct 26 ms 2680 KB Output is correct
8 Correct 46 ms 2680 KB Output is correct
9 Correct 43 ms 2552 KB Output is correct
10 Correct 29 ms 2688 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 500 ms 21240 KB Output is correct
2 Correct 470 ms 20912 KB Output is correct
3 Correct 527 ms 21240 KB Output is correct
4 Correct 468 ms 21036 KB Output is correct
5 Correct 480 ms 21240 KB Output is correct
6 Correct 465 ms 21244 KB Output is correct
7 Correct 491 ms 21344 KB Output is correct
8 Correct 496 ms 20984 KB Output is correct
9 Correct 480 ms 21444 KB Output is correct
10 Correct 537 ms 21496 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct

Subtask #5
11.0 / 11.0

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

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct

Subtask #7
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 2680 KB Output is correct
2 Correct 45 ms 2680 KB Output is correct
3 Correct 51 ms 2808 KB Output is correct
4 Correct 52 ms 2808 KB Output is correct
5 Correct 50 ms 2808 KB Output is correct
6 Correct 44 ms 2680 KB Output is correct
7 Correct 44 ms 2680 KB Output is correct
8 Correct 44 ms 2808 KB Output is correct
9 Correct 45 ms 2680 KB Output is correct
10 Correct 46 ms 2808 KB Output is correct
11 Correct 26 ms 2688 KB Output is correct
12 Correct 26 ms 2816 KB Output is correct
13 Correct 27 ms 2816 KB Output is correct
14 Correct 28 ms 2816 KB Output is correct
15 Correct 47 ms 2688 KB Output is correct
16 Correct 27 ms 2688 KB Output is correct
17 Correct 26 ms 2680 KB Output is correct
18 Correct 46 ms 2680 KB Output is correct
19 Correct 43 ms 2552 KB Output is correct
20 Correct 29 ms 2688 KB Output is correct
21 Correct 500 ms 21240 KB Output is correct
22 Correct 470 ms 20912 KB Output is correct
23 Correct 527 ms 21240 KB Output is correct
24 Correct 468 ms 21036 KB Output is correct
25 Correct 480 ms 21240 KB Output is correct
26 Correct 465 ms 21244 KB Output is correct
27 Correct 491 ms 21344 KB Output is correct
28 Correct 496 ms 20984 KB Output is correct
29 Correct 480 ms 21444 KB Output is correct
30 Correct 537 ms 21496 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 4 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 4 ms 384 KB Output is correct
36 Correct 4 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 5 ms 384 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 5 ms 384 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 5 ms 384 KB Output is correct
46 Correct 5 ms 384 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 5 ms 384 KB Output is correct
49 Correct 5 ms 384 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 6 ms 512 KB Output is correct
52 Correct 5 ms 512 KB Output is correct
53 Correct 5 ms 512 KB Output is correct
54 Correct 5 ms 512 KB Output is correct
55 Correct 6 ms 512 KB Output is correct
56 Correct 5 ms 512 KB Output is correct
57 Correct 5 ms 512 KB Output is correct
58 Correct 6 ms 512 KB Output is correct
59 Correct 6 ms 512 KB Output is correct
60 Correct 5 ms 512 KB Output is correct
61 Correct 343 ms 20856 KB Output is correct
62 Correct 218 ms 22444 KB Output is correct
63 Correct 449 ms 21880 KB Output is correct
64 Correct 314 ms 22264 KB Output is correct
65 Correct 382 ms 22392 KB Output is correct
66 Correct 428 ms 22392 KB Output is correct
67 Correct 391 ms 22008 KB Output is correct
68 Correct 483 ms 22396 KB Output is correct
69 Correct 460 ms 22008 KB Output is correct
70 Correct 441 ms 21752 KB Output is correct