oj.uz

Submission #68501

# Submission time Handle Problem Language Result Execution time Memory
68501 2018-08-17T08:27:50 Z tempytemptemp Divide and conquer (IZhO14_divide) C++14
48 / 100
 1000 ms 3412 KB 
/*
  We found Despacito 5 during contest (not clickbait)
*/
#include	<iostream>
#include	<cstdio>
#include	<vector>
#include 	<set>
#include	<map>
#include	<queue>
#include	<stack>
#include	<algorithm>
#include	<cstring>
#include	<cfloat>
#include	<cmath>
#include	<cassert>
#include	<locale>
#include	<string>
#include	<bitset>
#include	<functional>
#include	<climits>
#include	<iomanip>
using namespace std;

#define read(x)     freopen(x,"r",stdin)
#define write(x)    freopen(x,"w",stdout)
#define cl(a,b)	    memset(a,b,sizeof(a))
#define all(x)      x.begin(),x.end()
#define rall(x)     x.rbegin(),x.rend()
#define ll          long long
#define ld          long double
#define vec         vector
#define vi          vec<int>
#define heap        priority_queue
#define res         reserve
#define pb          push_back
#define f(x,y,z)    for(int x=(y); x<(z); x++)
#define fd(x,y,z)   for(int x=(y); x>=(z); x--)
#define fit(x,y)    for(auto x: y)
#define srt(x)      sort(all(x))
#define rsrt(x)     sort(rall(x))
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
#define pii         pair<int,int>
#define ppi         pair<pii,int>
#define pip         pair<int,pii>
#define mp          make_pair
#define f1          first
#define s2          second
#define cdbg(x)     cerr<<#x<<" = "<<x<<",\t";
#define cdbl        cerr<<"\n----------\n";
#define pow2(x)     ((x)*(x))
#define edist(x1, y1, x2, y2) (sqrt((pow2(x1-x2)+pow2(y1-y2))))
#define mdist(x1, y1, x2, y2) (abs((x1)-(x2))+abs((y1)-(y2)))
#define y1          FullSensei
#define mid         ((ss+se)>>1)
#define left        (si<<1)
#define right       ((si<<1)+1)
#define pi          3.141592653589793
#define popcount    __builtin_popcount
#define spc			' '
#define endl		'\n'
#define in			insert
#define up_b		upper_bound
#define low_b 		lower_bound
#define Decimal		fixed<<setprecision(20)

bool checkbit(int x,int y){return (x&(1<<y));}
int setbit(int x,int y){return (x^(1<<y));}
const int dirs[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int mod=1e9+7;
const int p1=805306457;
const int p2=1610612741;
const int INF=1e9;
const int N=1e5;
struct mine{
	int x, g, d;
//	mine(int xx, int gg, int dd){
//		x=xx;
//		g=gg;
//		d=dd;
//	}
};
mine a[N+7];
int n;

ll preg[N+7];
ll pred[N+7];

int main(){
	scanf("%d",&n);
	f(i,1,n+1){
		cin>>a[i].x>>a[i].g>>a[i].d;
	}
	f(i,1,n+1){
		preg[i]=preg[i-1]+a[i].g;
		pred[i]=pred[i-1]+a[i].d;
	}
	ll ans=0;
	int r=0;
	f(i,1,n+1){
		fd(j,n,max(i,r+1)){
			ll totd=pred[j] - pred[i-1];
			if(totd >= a[j].x-a[i].x){
				ans=max(ans, preg[j] - preg[i-1]);
				r=j;
				break;
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}

Compilation message

divide.cpp: In function 'int main()':
divide.cpp:89:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 368 KB Output is correct
3 Correct 2 ms 444 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 572 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 2 ms 572 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 2 ms 620 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 4 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 4 ms 624 KB Output is correct
6 Correct 4 ms 624 KB Output is correct
7 Correct 3 ms 624 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 5 ms 636 KB Output is correct
10 Correct 7 ms 636 KB Output is correct
11 Correct 26 ms 764 KB Output is correct
12 Correct 26 ms 764 KB Output is correct

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 764 KB Output is correct
2 Correct 11 ms 896 KB Output is correct
3 Correct 16 ms 1004 KB Output is correct
4 Correct 66 ms 2044 KB Output is correct
5 Correct 77 ms 2044 KB Output is correct
6 Correct 177 ms 3280 KB Output is correct
7 Correct 117 ms 3364 KB Output is correct
8 Correct 120 ms 3364 KB Output is correct
9 Correct 115 ms 3364 KB Output is correct
10 Execution timed out 1077 ms 3412 KB Time limit exceeded
11 Halted 0 ms 0 KB -