Submission #17329

#	Time	Username	Problem	Language	Result	Execution time	Memory
17329		gs14004	돌 무게 재기 (IZhO11_stones)	C++14	0 / 100	1000 ms	1892 KiB

stones

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <iostream>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;

bool low(vector<int> &v1, vector<int> &v2){
	int p = 0;
	if(v1.size() > v2.size()) return 0;
	return *max_element(v1.begin(), v1.end()) < *max_element(v2.begin(), v2.end());
	for(int i=0; i<v1.size(); i++){
		if(v1[i] > v2[v2.size() - v1.size() + i]){
			return 0;
		}
	}
	return 1;
}

vector<int> v[3];
int main(){
	int q;
	scanf("%d",&q);
	v[1].push_back(0);
	v[2].push_back(0);
	while(q--){
		int a, b;
		scanf("%d %d",&b,&a);
		v[a].push_back(b);
		sort(v[a].begin(),v[a].end());
		if(low(v[1], v[2])){
			puts("<");
		}
		else if(low(v[2], v[1])){
			puts(">");
		}
		else puts("?");
	}
}

• Subtask 1: 0 / 100