제출 #224313

#제출 시각아이디문제언어결과실행 시간메모리
224313kshitij_sodani카멜레온의 사랑 (JOI20_chameleon)C++17
0 / 100
5 ms512 KiB
#include <iostream> #include <bits/stdc++.h> using namespace std; #define a first #define b second #define pb push_back #include "chameleon.h" void Solve(int n){ int vis[2*n]; for(int i=0;i<2*n;i++){ vis[2*n]=0; } for(int i=0;i<2*n;i++){ if(vis[2*n]=0){ vector<int> aa; for(int j=0;j<2*n;j++){ if(i==j){ continue; } int x=Query({i+1,j+1}); if(x==1){ aa.pb(j+1); } } if(aa.size()==1){ vis[i]=1; vis[aa[0]-1]=1; Answer(i+1,aa[0]); } else{ vector<int> bb; for(int j=0;j<2*n;j++){ if(j!=i and j!=aa[0]-1){ bb.pb(j+1); } } int x=Query(bb); if(x==n){ vis[i]=1; vis[aa[1]-1]=1; Answer(i+1,aa[1]); } else{ vis[i]=1; vis[aa[0]-1]=1; Answer(i+1,aa[0]); } } } } }

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

chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:14:14: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   if(vis[2*n]=0){
      ~~~~~~~~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...