oj.uz

Submission #39701

# Submission time Handle Problem Language Result Execution time Memory
39701 2018-01-17T11:58:14 Z b00n0rp Weighting stones (IZhO11_stones) C++14
0 / 100
 219 ms 25452 KB 
/*input
5
1 2
3 1
2 1
4 2
5 1
*/		
#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define int ll
#define pb push_back
#define INF 1000000000
#define MOD 1000000007
#define mp make_pair
const double PI=3.141592653589793238462643383279502884197169399375105820974944;
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define F first
#define S second
#define mii map<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define itr :: iterator it
#define WL(t) while(t --)
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;

int power(int a,int b,int m = MOD){
	if(b == 0) return 1;
	if(b == 1) return a;
	int x = power(a,b/2,m)%m;
	x = (x*x)%m;
	if(b%2) return (x*a)%m;
	return x;
}

struct node{
	int lazy,mx,mn;
};

int n;
node seg[1000005];

void push(int node){
	if(!seg[node].lazy) return;
	seg[node*2].mx += seg[node].lazy;
	seg[node*2].mn += seg[node].lazy;
	seg[node*2].lazy += seg[node].lazy;
	seg[node*2+1].mx += seg[node].lazy;
	seg[node*2+1].mn += seg[node].lazy;
	seg[node*2+1].lazy += seg[node].lazy;
	seg[node].lazy = 0;
}

void upd(int node,int xl,int xr,int l,int r,int val){
	// cout << node << " " << xl << " " << xr << " " << l << " " << r << " " << val << endl;
	if(xl > r or xr < l or xr < xl) return ;
	if(l <= xl and xr <= r){
		seg[node].lazy += val;
		seg[node].mn += val;
		seg[node].mx += val;
		return;
	}
	push(node);
	int mid = (xl+xr)/2;
	upd(2*node,xl,mid,l,r,val);
	upd(2*node+1,mid+1,xr,l,r,val);
	seg[node].mn = min(seg[2*node].mn,seg[2*node+1].mn);
	seg[node].mx = max(seg[2*node].mx,seg[2*node+1].mx);
}

signed main(){
	// ios_base::sync_with_stdio(false);
	// cin.tie(0);
	// cout.tie(0);

	// REP(i,400005){
	// 	seg[i] = {0,-1,1};
	// }

	cin >> n;
	REP(i,n){
		int r,s; cin >> r >> s;
		if(s == 2) s = -1;
		upd(1,1,n,1,r,s);
		// cout << seg[1].mx << " " << seg[1].mn << endl;
		int lol1 = (seg[1].mx > 0),lol2 = (seg[1].mn < 0);
		if(lol1 and lol2) cout << "?\n";
		else if(lol1) cout << ">\n";
		else cout << "<\n";
	}
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 25452 KB Output is correct
2 Correct 0 ms 25452 KB Output is correct
3 Correct 0 ms 25452 KB Output is correct
4 Correct 0 ms 25452 KB Output is correct
5 Correct 0 ms 25452 KB Output is correct
6 Correct 6 ms 25452 KB Output is correct
7 Correct 0 ms 25452 KB Output is correct
8 Correct 0 ms 25452 KB Output is correct
9 Correct 0 ms 25452 KB Output is correct
10 Correct 19 ms 25452 KB Output is correct
11 Runtime error 219 ms 25452 KB Execution timed out (wall clock limit exceeded)
12 Halted 0 ms 0 KB -