제출 #640730

#제출 시각아이디문제언어결과실행 시간메모리
6407301zaid1죄수들의 도전 (IOI22_prison)C++17
0 / 100
0 ms212 KiB
#include "prison.h" #include <bits/stdc++.h> using namespace std; vector<vector<int>> devise_strategy(int n) { int p[] = {1, 10, 100, 1000, 10000}; vector<vector<int>> v(50, vector<int>(n+1, 0)); for (int i = 0; i < 50; i++) { int A = 0, B = 1; if (i/10 == 0) v[i][0] = 0; else v[i][0] = !(i/10%2); for (int j = 1; j <= n; j++) { if (i/10) { int d = j/p[i/10-1]%10; if (d > i%10) v[i][j] = -1-v[i][0]; else if (d < i%10) v[i][j] = -1-(!v[i][0]); else v[i][j] = (i/10-1)*10 + (j/p[i/10-2])%10; } else { v[i][j] = 40+j/1000; } } } return v; }

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

prison.cpp: In function 'std::vector<std::vector<int> > devise_strategy(int)':
prison.cpp:10:13: warning: unused variable 'A' [-Wunused-variable]
   10 |         int A = 0, B = 1;
      |             ^
prison.cpp:10:20: warning: unused variable 'B' [-Wunused-variable]
   10 |         int A = 0, B = 1;
      |                    ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...