# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362867 | 79brue | 최후의 만찬 (IOI12_supper) | C++14 | 156 ms | 15352 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 <bits/stdc++.h>
#include "advisor.h"
using namespace std;
typedef long long ll;
struct dat{
int l, r, x;
dat(){}
dat(int l, int r, int x): l(l), r(r), x(x){}
bool operator<(const dat &nxt)const{
return r<nxt.r;
}
};
int n, k, m;
int arr[100002];
vector<int> occurence[100002];
set<dat> st;
set<int> now;
vector<bool> bits;
void ComputeAdvice(int *C, int N, int K, int M){
n = N, k = K, m = M;
bits.resize(n+k);
for(int i=0; i<n; i++){
arr[i] = C[i];
occurence[arr[i]].push_back(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... |