oj.uz

Submission #337560

# Submission time Handle Problem Language Result Execution time Memory
337560 2020-12-21T05:10:19 Z Kerim Divide and conquer (IZhO14_divide) C++17
100 / 100
 112 ms 16492 KB 
#include "bits/stdc++.h"
#define MAXN 200009
#define INF 1000000000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
ll F[MAXN];
void upd(int x,ll val){
	for(;x<MAXN;x+=x&(-x))
		umin(F[x],val);	
}
ll tap(int x){
	ll res=INF;
	for(;x;x-=x&(-x))
		umin(res,F[x]);
	return res;
}	
int x[MAXN];
ll e[MAXN],g[MAXN];
map<ll,int>pm;
int main(){
  // freopen("file.in", "r", stdin);
    for(int i=0;i<MAXN;i++)F[i]=INF;
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
    	scanf("%d%lld%lld",x+i,g+i,e+i);
    	g[i]+=g[i-1];e[i]+=e[i-1];
    	pm[e[i-1]-x[i]]=pm[e[i]-x[i]]=1;
    }
    int c=0;
    tr(it,pm)
    	it->ss=++c;
    ll ans=0;
    for(int i=1;i<=n;i++){
    	upd(pm[e[i-1]-x[i]],g[i-1]);
		umax(ans,g[i]-tap(pm[e[i]-x[i]]));	
    }printf("%lld\n",ans);
	return 0;
}

Compilation message

divide.cpp: In function 'int main()':
divide.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   38 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
divide.cpp:40:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   40 |      scanf("%d%lld%lld",x+i,g+i,e+i);
      |      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 1 ms 1900 KB Output is correct
4 Correct 1 ms 1920 KB Output is correct
5 Correct 1 ms 1900 KB Output is correct
6 Correct 1 ms 1900 KB Output is correct
7 Correct 1 ms 1900 KB Output is correct
8 Correct 2 ms 1900 KB Output is correct
9 Correct 1 ms 1900 KB Output is correct
10 Correct 2 ms 1900 KB Output is correct
11 Correct 1 ms 1900 KB Output is correct
12 Correct 1 ms 1900 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 1 ms 1900 KB Output is correct
4 Correct 1 ms 1920 KB Output is correct
5 Correct 1 ms 1900 KB Output is correct
6 Correct 1 ms 1900 KB Output is correct
7 Correct 1 ms 1900 KB Output is correct
8 Correct 2 ms 1900 KB Output is correct
9 Correct 1 ms 1900 KB Output is correct
10 Correct 2 ms 1900 KB Output is correct
11 Correct 1 ms 1900 KB Output is correct
12 Correct 1 ms 1900 KB Output is correct
13 Correct 1 ms 1900 KB Output is correct
14 Correct 1 ms 1900 KB Output is correct
15 Correct 2 ms 2028 KB Output is correct
16 Correct 2 ms 2028 KB Output is correct
17 Correct 2 ms 2028 KB Output is correct
18 Correct 3 ms 2028 KB Output is correct
19 Correct 2 ms 2028 KB Output is correct
20 Correct 2 ms 2028 KB Output is correct
21 Correct 3 ms 2156 KB Output is correct
22 Correct 4 ms 2156 KB Output is correct
23 Correct 6 ms 2668 KB Output is correct
24 Correct 6 ms 2668 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 1 ms 1900 KB Output is correct
4 Correct 1 ms 1920 KB Output is correct
5 Correct 1 ms 1900 KB Output is correct
6 Correct 1 ms 1900 KB Output is correct
7 Correct 1 ms 1900 KB Output is correct
8 Correct 2 ms 1900 KB Output is correct
9 Correct 1 ms 1900 KB Output is correct
10 Correct 2 ms 1900 KB Output is correct
11 Correct 1 ms 1900 KB Output is correct
12 Correct 1 ms 1900 KB Output is correct
13 Correct 1 ms 1900 KB Output is correct
14 Correct 1 ms 1900 KB Output is correct
15 Correct 2 ms 2028 KB Output is correct
16 Correct 2 ms 2028 KB Output is correct
17 Correct 2 ms 2028 KB Output is correct
18 Correct 3 ms 2028 KB Output is correct
19 Correct 2 ms 2028 KB Output is correct
20 Correct 2 ms 2028 KB Output is correct
21 Correct 3 ms 2156 KB Output is correct
22 Correct 4 ms 2156 KB Output is correct
23 Correct 6 ms 2668 KB Output is correct
24 Correct 6 ms 2668 KB Output is correct
25 Correct 5 ms 2688 KB Output is correct
26 Correct 9 ms 3308 KB Output is correct
27 Correct 10 ms 3328 KB Output is correct
28 Correct 43 ms 9088 KB Output is correct
29 Correct 45 ms 9196 KB Output is correct
30 Correct 112 ms 16364 KB Output is correct
31 Correct 100 ms 16364 KB Output is correct
32 Correct 99 ms 16492 KB Output is correct
33 Correct 85 ms 16364 KB Output is correct
34 Correct 97 ms 15980 KB Output is correct
35 Correct 112 ms 16364 KB Output is correct
36 Correct 92 ms 16364 KB Output is correct