# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
26789 | samir_droubi | Last supper (IOI12_supper) | C++14 | 102 ms | 27552 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;
void ComputeAdvice(int *C, int N, int K, int M)
{
const int mxn=(1e5)+5;
bool ans[mxn*2];
bool sc[mxn];
int ord[mxn];
vector<int>v[mxn];
set<pair<int,int> >s;
for(int i=0;i<N;++i)v[C[i]].push_back(i);
for(int i=0;i<N;++i)
{
v[i].push_back(N);
reverse(v[i].begin(),v[i].end());
}
for(int i=0;i<K;++i)
{
ord[i]=-1;
sc[i]=true;
s.insert({v[i].back(),i});
v[i].pop_back();
}
for(int i=0;i<N;++i)
{
# | 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... |