Submission #1187705

#TimeUsernameProblemLanguageResultExecution timeMemory
1187705MatteoArcariSoccer Stadium (IOI23_soccer)C++20
3.50 / 100
193 ms31772 KiB
#include "soccer.h" #include <bits/stdc++.h> using namespace std; int biggest_stadium(int n, vector<vector<int>> f) { int ans = 0; for (auto _: {0, 1}) { ans = 0; vector<int> l(n), r(n); for (int i = 0; i < n; i++) { bool found = 0; bool flag = 0; int _l = -1, _r = -1; for (int j = 0; j < n; j++) { if (!f[i][j]) { _r = j; if (_l == -1) _l = j; ans++; found = 1; if (flag) return 0; } else if (found) flag = 1; } for (int j = 0; j < i; j++) { if (l[j] < _l && r[j] < _r) return 0; if (l[j] > _l && r[j] > _r) return 0; } l[i] = _l; r[i] = _r; } for (int i = 0; i < n; i++) { for (int j = 0; j < i; j++) { swap(f[i][j], f[j][i]); } } } return ans; }
#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...