| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 104867 | figter001 | Last supper (IOI12_supper) | C++17 | 198 ms | 18240 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 long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int nax = 1e5 + 50;
const int oo = 1e9;
vector<int> lst[nax];
set<pair<int,int>> st;
bool in[nax],rem[nax];
int w[nax];
void ComputeAdvice(int *C, int n, int k, int M) {
for(int i=0;i<n;i++)
lst[i].push_back(oo);
for(int i=n-1;i>=0;i--)
lst[C[i]].push_back(i);
for(int i=0;i<k;i++){
st.insert({-lst[i].back(),i});
lst[i].pop_back();
in[i] = 1;
}
for(int i=0;i<n;i++){
if(in[C[i]] == 1){
st.erase(--st.end());
| # | 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... | ||||