# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154297 | nvmdava | Red-blue table (IZhO19_stones) | C++17 | 57 ms | 5368 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>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define N 1200005
#define MOD 1000000007
#define INF 0x3f3f3f3f
int res, cur;
int t[1005][1005];
int cnt[1005];
void go(){
int n, m;
cin>>n>>m;
bool sw = 0;
if(n < m){
sw = 1;
swap(n, m);
}
int cur = n;
for(int i = 1; i <= n; i++){
cnt[i] = m;
for(int j = 1; j <= m; j++){
t[i][j] = 1;
}
}
int q = (n + 2) >> 1;
# | 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... |