# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16759 | CodingBug | Scales (IOI15_scales) | C++98 | 13 ms | 2124 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 "scales.h"
#include <stdio.h>
#include <algorithm>
#include <vector>
#define M 6
using namespace std;
struct TestCase{
int a[M+1];
} t[720];
struct Node{
vector<TestCase> cd;
Node *chi[3];
int ct,cp[4];
} *rt;
int tn;
void makeTestCase(int lev,int ch,int x[]){
if(lev>=M){
int i;
for(i=0;i<M;i++){
t[tn].a[x[i]]=i;
}
tn++;
}else{
int i;
for(i=1;i<=M;i++){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |