# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
348427 | casperwang | Red-blue table (IZhO19_stones) | C++14 | 78 ms | 3436 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define pii pair<int,int>
#define All(x) x.begin(), x.end()
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }
int t, n, m;
vector<vector<char>> A, B;
vector <pii> cnt;
int ansA, ansB;
void init() {
A.clear(), B.clear();
A.resize(n), B.resize(n);
for (int i = 0; i < n; i++)
A[i].resize(m), B[i].resize(m);
ansA = n, ansB = m;
}
void check() {
int tmp = ansA;
for (int i = 0; i < n; i++) {
int c = 0;
for (int j = 0; j < m; j++) {
if (A[i][j] == '+') c++;
}
if (c * 2 > m) tmp--;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |