Submission #1241776

#TimeUsernameProblemLanguageResultExecution timeMemory
1241776BoasSoccer Stadium (IOI23_soccer)C++17
6 / 100
224 ms31772 KiB
#include "soccer.h" #include <bits/stdc++.h> using namespace std; typedef vector<int> vi; typedef set<int> si; typedef int64_t i64; typedef vector<i64> vi64; typedef pair<i64, int> ii; typedef vector<ii> vii; typedef vector<vii> vvii; typedef vector<bool> vb; #define pb push_back #define sz(x) (int)(x).size() #define loop(n, i) for (int i = 0; i < (n); i++) #define ALL(x) begin(x), end(x) int res(int N, int x, int y) { int A = N * N; if (x == -1) return A; return A - min({(x + 1) * (y + 1), (N - x) * (y + 1), (N - x) * (N - y), (x + 1) * (N - y)}); } int biggest_stadium(int N, std::vector<std::vector<int>> F) { assert(res(5, 4, 4) == 24); assert(res(5, 2, 2) == 16); assert(res(5, 0, 0) == 24); assert(res(5, 4, 0) == 24); assert(res(5, 0, 4) == 24); int x = -1, y = -1; loop(N, i) loop(N, j) if (F[i][j] == 1) { x = i; y = j; } return res(N, x, y); }
#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...