# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
58827 | joaogui1 | Last supper (IOI12_supper) | C++14 | 783 ms | 182400 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>
#define ff first
#define ss second
using namespace std;
typedef pair<int, int> pii;
set<pii> s;
int sca[100100];
vector <int> ans;
queue <int> q[100100];
vector <int> dectobin(int n){
vector<int> r;
for(int i = 17; i > -1; --i)
if((1 << i) <= n){
r.push_back(1);
n -= (1 << i);
}
else r.push_back(0);
return r;
}
void ComputeAdvice(int *C, int N, int K, int M){
vector <int> aux;
for(int i = 0; i < N; ++i) q[C[i]].push(-i);
for(int i = 0; i < N; ++i) q[i].push(-2*N);
for(int i = 0; i < K; ++i) s.insert(pii(q[i].front(), i));
for(int i = 0; i < N; ++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... |