제출 #290513

#제출 시각아이디문제언어결과실행 시간메모리
290513matheo_apdChessboard (IZhO18_chessboard)C++17
16 / 100
210 ms5880 KiB
#include <bits/stdc++.h> using namespace std; #define maxn 100005 #define ll long long int ll n, k; vector<int> chess[maxn]; void solve_k0(){ ll minimo = 999999; for(int i = 1; i < n; i++){ if(n % i != 0) continue; int test = i*i; minimo = min(minimo, ((n*n/test)/2)*test); } cout << minimo << endl; } int main(){ memset(chess, 0, sizeof chess); cin >> n >> k; if(k == 0) solve_k0(); else{ for(int i = 0; i < k; i++){ int x, y, l, m; cin >> x >> y; cin >> l >> m; //8) chess[x].push_back(y); } ll cont = 0; for(int i = 1; i <= n; i++){ ll cont_errado = 0, cont_certo = 0; for(int j = 0; j < chess[i].size(); j++){ //if((i+j)%2 == chess[i][j]) cont_errado++; int row = chess[i][j]; if(i%2 == row%2) cont_certo++; else cont_errado++; } cont += cont_errado + n/2 + i%2 - cont_certo; } cout << min(cont, n*n - cont) << endl; } return 0; }

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

chessboard.cpp: In function 'int main()':
chessboard.cpp:30:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |    for(int j = 0; j < chess[i].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~~~
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...