# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
993103 | Yazan_SA | Cave (IOI13_cave) | C++17 | 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 "cave.h"
#include<bits/stdc++.h>
using namespace std;
// int n=8,tot;
// int S[]={1,1,0,1,1,0,0,0};
// int D[]={5,2,7,6,0,3,4,1};
// int F[8]={};
// int tryCombination(int s[]){
// for(int i=0; i<n; i++){
// F[D[i]]=i;
// }
// tot++;
// int ac=0;
// for(int i=0; i<n; i++){
// if(s[F[i]]==S[F[i]])ac=i;
// else break;
// }
// return (ac==n-1 ? -1 : ac);
// }
// int n2;
// int ask(int x[]){
// int ts=tryCombination(x)+1;
// return (ts==0 ? n2 : ts);
// }
// void answer(int s[], int d[]){
// cout<<"try: \n";