| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 25714 | gs14004 | Carnival (CEOI14_carnival) | C++11 | 0 ms | 0 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<vector>
#include<set>
#include "carnival.h"
using namespace std;
void findClothes(int N, vector<int> &C)
{
int size[151] = {};
int piv = 0;
set<int> s;
for(int i=1; i<=N; i++){
s.insert(i);
size[i] = party(s);
if(size[i] == size[i-1]){
int s = 1, e = i-1;
while (s != e) {
int m = (s+e)/2;
set<int> original;
for (int i=s; i<=m; i++) {
original.insert(i);
}
int v = party(original);
original.insert(i);
if(v != party(original)) s = m+1;
else e = m;
}
C.push_back(C[e-1]);
}
else{
C.push_back(++piv);
}
}
}
