# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1040264 |
2024-07-31T21:11:58 Z |
vjudge1 |
popa (BOI18_popa) |
C++17 |
|
54 ms |
668 KB |
#include "popa.h"
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,mxcont=b;i<mxcont;i++)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) {for(auto jfhg:v)cout<<jfhg<<" ";cout<<"\n";}
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
int solve(int n, int* L, int* R)
{
fore(i,0,n)L[i]=R[i]=-1;
auto gano=[&](ll i, ll j){
return query(j,i,i,i);
};
vector<ll>v;
fore(i,0,n){
while(SZ(v)&&gano(i,v.back()))L[i]=v.back(),v.pop_back();
if(SZ(v))R[v.back()]=i;
v.pb(i);
}
return v[0];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
344 KB |
Output is correct |
2 |
Correct |
6 ms |
344 KB |
Output is correct |
3 |
Correct |
3 ms |
344 KB |
Output is correct |
4 |
Correct |
4 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
47 ms |
424 KB |
Output is correct |
2 |
Correct |
53 ms |
344 KB |
Output is correct |
3 |
Correct |
24 ms |
596 KB |
Output is correct |
4 |
Correct |
49 ms |
416 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
40 ms |
600 KB |
Output is correct |
2 |
Correct |
54 ms |
668 KB |
Output is correct |
3 |
Correct |
40 ms |
436 KB |
Output is correct |
4 |
Correct |
50 ms |
436 KB |
Output is correct |