# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24466 | gs14004 | Last supper (IOI12_supper) | C++11 | 241 ms | 10600 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "advisor.h"
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
typedef pair<int,int> pi;
set<pi> s;
vector<pi> nexts;
int query[100005];
int is_in[100005];
int getnxt(int val, int time){
auto t = upper_bound(nexts.begin(), nexts.end(), pi(val, time));
if(t->first != val) return 1e9;
return t->second;
}
bool PopPrevRequest[100005];
bool PopK[100005];
void ComputeAdvice(int *C, int N, int K, int M) {
for(int i=0; i<N; i++){
nexts.push_back(pi(C[i], i));
}
sort(nexts.begin(), nexts.end());
for(int i=0; i<K; i++){
s.insert(pi(getnxt(i, -1), i));
is_in[i] = 1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |