oj.uz

답안 #63438

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
63438 2018-08-01T19:34:11 Z hamzqq9 popa (BOI18_popa) C++14
100 / 100
 121 ms 532 KB 
#include<bits/stdc++.h>
#include "popa.h"
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<ii,int>
#define sz(x) (x.size())
#define orta ((bas+son)>>1)
#define all(x) x.begin(),x.end()
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define pw(x) (1<<(x))
#define inf 1000500000
#define MOD 1000000007
//#define N 3005
#define MAX 10000006
#define LOG 20
using namespace std;

int solve(int N,int *Left,int *Right) {

	stack<int> s;

	int head=0;

	for(int i=0;i<N;i++) {

		Left[i]=Right[i]=-1;

		while(sz(s) && query(s.top(),i,i,i)) {

			Right[s.top()]=Left[i];
			Left[i]=s.top();

			s.pop();

		}

		if(sz(s)) {

			Right[s.top()]=i;

		}
		else {

			head=i;

		}

		s.push(i);

	}

	return head;

}

Subtask #1
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 252 KB Output is correct
2 Correct 12 ms 308 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 8 ms 428 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 504 KB Output is correct
2 Correct 103 ms 508 KB Output is correct
3 Correct 70 ms 508 KB Output is correct
4 Correct 103 ms 508 KB Output is correct

Subtask #3
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 524 KB Output is correct
2 Correct 88 ms 524 KB Output is correct
3 Correct 100 ms 532 KB Output is correct
4 Correct 65 ms 532 KB Output is correct