oj.uz

Submission #765587

# Submission time Handle Problem Language Result Execution time Memory
765587 2023-06-24T21:33:21 Z edfearay11 Divide and conquer (IZhO14_divide) C++17
48 / 100
 1000 ms 1520 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
#define f(i,a,b) for(int i=a;i<b;i++)
#define af(i,a,b) for(int i=a;i>=b;i--)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define PB push_back
#define MP make_pair
#define F first
#define S second
 
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
 
const ll mod=1e9+7;
const int maxN=1e5+5;
const ll inf=1e12;

void go(){
	ll n;
	cin>>n;
	vector<ll> v1,v2,v3;
	ll a,b,c;
	f(i,0,n){
		cin>>a>>b>>c;
		v1.PB(a);
		v2.PB(b);
		v3.PB(c);
	}

	ll g=0;
	f(i,0,n){
		ll en=0;
		ll ini=i;
		ll gl=0;
		f(j,i,n){
			en+=v3[j];
			gl+=v2[j];
			if(v1[j]-v1[i]<=en && gl>g) g=gl;
		}
	}
	cout<<g<<"\n";
}

int main(){
	//fastio;
	int test=1;
	//cin>>test;
	f(i,1,test+1){
		//cout<<"Case "<<i<<":\n";
		go();
	}
 
	return 0;
}

Compilation message

divide.cpp: In function 'void go()':
divide.cpp:36:6: warning: unused variable 'ini' [-Wunused-variable]
   36 |   ll ini=i;
      |      ^~~

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

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

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 2 ms 212 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 12 ms 468 KB Output is correct
24 Correct 12 ms 468 KB Output is correct
25 Correct 14 ms 468 KB Output is correct
26 Correct 51 ms 724 KB Output is correct
27 Correct 53 ms 724 KB Output is correct
28 Execution timed out 1089 ms 1520 KB Time limit exceeded
29 Halted 0 ms 0 KB -