Submission #1225161

#TimeUsernameProblemLanguageResultExecution timeMemory
1225161amine_aroua축구 경기장 (IOI23_soccer)C++20
1.50 / 100
201 ms47636 KiB
#include "soccer.h" #include<bits/stdc++.h> using namespace std; int biggest_stadium(int N, std::vector<std::vector<int>> F) { vector<vector<int>> grid(N + 2 , vector<int>(N + 2 , 1)); int ret = 0; for(int i= 1 ; i <= N ; i++) { for(int j = 1 ; j <= N ; j++) { grid[i][j] = F[i-1][j-1]; ret+=(grid[i][j]^1); } } bool check = true; for(int i = 1 ; i <= N ; i++) { int ans = 0; for(int j = 1 ;j <= N+ 1 ; j++) { ans+=(grid[i][j] != grid[i][j - 1]); } if(ans != 2) { check = false; break; } } for(int j = 1 ; j <= N ; j++) { int ans = 0; for(int i = 1 ;i <= N + 1 ; i++) { ans+= (grid[i - 1][j] != grid[i][j]); } if(ans != 2) { check = false; break; } } if(check == false) ret = 0; return ret; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...