oj.uz

답안 #36182

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
36182 2017-12-06T07:23:26 Z Kerim 돌 무게 재기 (IZhO11_stones) C++14
100 / 100
 76 ms 6704 KB 
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#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;}
int lazy[MAXN<<2],mx[MAXN<<2],mn[MAXN<<2];
void shift(int nd){
	int &ret=lazy[nd];
	if(!ret)
		return;
	lazy[nd<<1]+=ret;mx[nd<<1]+=ret;mn[nd<<1]+=ret;	
	lazy[nd<<1|1]+=ret;mx[nd<<1|1]+=ret;mn[nd<<1|1]+=ret;	
	ret=0;
}
void inc(int l,int r,int val,int nd,int x,int y){
	if(l>y or x>r)
		return;
	if(l<=x and y<=r){
		mx[nd]+=val;
		mn[nd]+=val;
		lazy[nd]+=val;
		return;
	}	
	shift(nd);
	int mid=(x+y)>>1;
	inc(l,r,val,nd<<1,x,mid);
	inc(l,r,val,nd<<1|1,mid+1,y);
	mx[nd]=max(mx[nd<<1],mx[nd<<1|1]);
	mn[nd]=min(mn[nd<<1],mn[nd<<1|1]);
}
int main(){
    //~ freopen("file.in", "r", stdin);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
		int p,t;
		scanf("%d%d",&p,&t);
		if(t==2)
			inc(1,p,-1,1,1,n);
		else
			inc(1,p,+1,1,1,n);
		int big=(mx[1]>0),small(mn[1]<0);
		if(big and small)
			puts("?");
		else if(big)
			puts(">");
		else
			puts("<");	
	}
	return 0;
}

Compilation message

stones.cpp: In function 'int main()':
stones.cpp:48:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
stones.cpp:51:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&p,&t);
                      ^

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 6704 KB Output is correct
2 Correct 0 ms 6704 KB Output is correct
3 Correct 0 ms 6704 KB Output is correct
4 Correct 0 ms 6704 KB Output is correct
5 Correct 0 ms 6704 KB Output is correct
6 Correct 0 ms 6704 KB Output is correct
7 Correct 0 ms 6704 KB Output is correct
8 Correct 0 ms 6704 KB Output is correct
9 Correct 0 ms 6704 KB Output is correct
10 Correct 0 ms 6704 KB Output is correct
11 Correct 46 ms 6704 KB Output is correct
12 Correct 76 ms 6704 KB Output is correct
13 Correct 53 ms 6704 KB Output is correct
14 Correct 56 ms 6704 KB Output is correct
15 Correct 46 ms 6704 KB Output is correct
16 Correct 53 ms 6704 KB Output is correct
17 Correct 49 ms 6704 KB Output is correct
18 Correct 59 ms 6704 KB Output is correct
19 Correct 59 ms 6704 KB Output is correct
20 Correct 49 ms 6704 KB Output is correct
21 Correct 63 ms 6704 KB Output is correct
22 Correct 53 ms 6704 KB Output is correct
23 Correct 53 ms 6704 KB Output is correct
24 Correct 49 ms 6704 KB Output is correct
25 Correct 46 ms 6704 KB Output is correct