# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73869 | FLDutchman | Last supper (IOI12_supper) | C++14 | 453 ms | 24128 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 <bits/stdc++.h>
using namespace std;
typedef int INT;
#define pb push_back
#define fst first
#define snd second
#define FOR(i,l,r) for(int i = (l); i < (r); i++)
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
int NUM_BITS;
set<int> q;
vi C;
void ComputeAdvice(int *c, int N, int K, int M) {
FOR(i,0,N) C.pb(c[i]);
FOR(i,0,N) C.pb(i);
for(; 1<<NUM_BITS < K; NUM_BITS++);
vi ne(N, -1), last(N,-1);
FOR(i,0,C.size()){
if(last[C[i]] != -1) ne[last[C[i]]] = i;
last[C[i]] = i;
}
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... |