제출 #29880

#제출 시각아이디문제언어결과실행 시간메모리
29880aybala동굴 (IOI13_cave)C++11
컴파일 에러
0 ms0 KiB
#include<bits/stdc++.h> #define fori(a,b,c) for(int a=b; a<c; a++) #define ford(a,b,c) for(int a=b; a>=c; a--) #define ll long long #define pb push_back #define mp make_pair #define pii pair<int,int> #define fi first #define se second using namespace std; int n; int sw[5000]; int used[5000]; pii a[5000],b[5000]; int s[5000],d[5000]; void exploreCave(int N) { n=N; int lg=0; while(1<<lg < n){ lg++; } cout << lg; int nn=(1<<lg); fori(i,0,n){ int las=0; int x=0; fori(j,0,lg+1){ fori(k,las,las+(nn/(1<<(j)))+x){ if(k>=n) break; if(!used[k]){ sw[k]=(b[i].se+1)%2; } else{ sw[k]=a[k].se; } } int trc=tryCombination(sw); if(n==1){ if(trc!=i){ b[i].se=1; } a[i].fi=i; a[i].se=b[i].se; } if(j==lg){ if(trc!=i){ used[las+1]=1; b[i].fi=las+1; a[las+1].fi=i; a[las+1].se=b[i].se; } else{ used[las]=1; b[i].fi=las; a[las].fi=i; a[las].se=b[i].se; } break; } if(trc!=i && j==0){ b[i].se = 1; continue; } if(trc==i && j==0){ fori(k,las,las+(nn/(1<<(j)))+x){ if(k>=n) break; if(!used[k]){ sw[k]=0; } else{ sw[k]=a[k].se; } } continue; } if(trc!=i && j!=0){ las=las+(nn/(1<<(j)))+x; continue; } if(trc==i && j!=0){ fori(k,las,las+(nn/(1<<(j)))+x){ if(k>=n) break; if(!used[k]){ sw[k]=(b[i].se)%2; } else{ sw[k]=a[k].se; } } continue; } } } fori(i,0,n){ s[i]=a[i].se; d[i]=a[i].fi; } answer(s,d); }

컴파일 시 표준 에러 (stderr) 메시지

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:50:12: error: 'tryCombination' was not declared in this scope
    int trc=tryCombination(sw);
            ^~~~~~~~~~~~~~
cave.cpp:124:2: error: 'answer' was not declared in this scope
  answer(s,d);
  ^~~~~~
cave.cpp:124:2: note: suggested alternative: 'assert'
  answer(s,d);
  ^~~~~~
  assert