# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92077 | Retro3014 | Mechanical Doll (IOI18_doll) | C++17 | 169 ms | 11172 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 "doll.h"
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> X, Y;
vector<int> type;
int N, K;
int idx(int x){
return -x-1;
}
void dfs(int x, int y){
int k=y/2;
if(K-k >= N){
K-=k;
X[idx(x)]=-1;
}else{
if(k==1){
X[idx(x)]=0;
}
else{
X[idx(x)]=-((int)X.size()+1);
X.push_back(0); Y.push_back(0); type.push_back(0);
}
}
if(k==1){
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |