제출 #1081060

#제출 시각아이디문제언어결과실행 시간메모리
1081060Hectorungo_18죄수들의 도전 (IOI22_prison)C++17
0 / 100
6 ms856 KiB
#include <bits/stdc++.h> // #include "messy.h" using namespace std; mt19937 gnd(time(nullptr)); // #define f first // #define s second // #define int long long vector<vector<int>> devise_strategy(int n){ int mx = log2(n); // mx-=1; vector<vector<int>> v(2*mx+1, vector<int> (n+1)); int la = 2*mx; int cnt = 4; for(int i = la; i >= 0; i--){ if(cnt > 2){ v[i][0]=1; } else{ v[i][0]=0; } cnt--; if(cnt == 0) cnt=4; } v[0][0]=0; for(int i = 1; i <= n; i++){ if(i&(1<<mx)) v[0][i]=2*mx; else v[0][i]=2*mx-1; } cnt = 4; for(int i = 2*mx-2; i >= -1; i--){ i+=2; if(cnt == 4){ int cur = (i-1)/2+1; for(int j = 1; j <= n; j++){ if(j&(1<<cur)){ if(j&(1<<(cur-1))){ if(i >= 3){ v[i][j]=i-2; } else{ v[i][j]=-1; } } else{ if(i >= 3){ v[i][j]=i-3; } else{ v[i][j]=-2; } } } else v[i][j]=-2; } } else if(cnt == 3){ int cur = (i-1)/2+1; for(int j = 1; j <= n; j++){ if(j&(1<<cur) == 0){ if(j&(1<<(cur-1))){ if(i >= 3){ v[i][j]=i-1; } else{ v[i][j]=-1; } } else{ if(i >= 3){ v[i][j]=i-2; } else{ v[i][j]=-2; } } } else v[i][j]=-1; } } else if(cnt == 2){ int cur = (i-1)/2+1; for(int j = 1; j <= n; j++){ if(j&(1<<cur)){ if(j&(1<<(cur-1))){ if(i >= 3){ v[i][j]=i-2; } else{ v[i][j]=-1; } } else{ if(i >= 3){ v[i][j]=i-3; } else{ v[i][j]=-2; } } } else v[i][j]=-2; } } else{ int cur = (i-1)/2+1; for(int j = 1; j <= n; j++){ if(j&(1<<cur) == 0){ if(j&(1<<(cur-1))){ if(i >= 3){ v[i][j]=i-1; } else{ v[i][j]=-1; } } else{ if(i >= 3){ v[i][j]=i-2; } else{ v[i][j]=-2; } } } else v[i][j]=-1; } } cnt--; if(cnt == 0) cnt = 4; i-=2; } return v; }

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

prison.cpp: In function 'std::vector<std::vector<int> > devise_strategy(int)':
prison.cpp:66:31: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   66 |                 if(j&(1<<cur) == 0){
      |                      ~~~~~~~~~^~~~
prison.cpp:114:31: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
  114 |                 if(j&(1<<cur) == 0){
      |                      ~~~~~~~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...