# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125494 | MoNsTeR_CuBe | Wombats (IOI13_wombats) | C++17 | 17 ms | 15992 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 "wombats.h"
#include <bits/stdc++.h>
using namespace std;
int row, col;
int sum = 0;
int h[5000][200];
int v[5000][200];
void init(int R, int C, int H[5000][200], int V[5000][200]) {
row = R;
col = C;
for(int i = 0; i < 5000; i++){
for(int j = 0; j < 200; j++){
h[i][j] = H[i][j];
v[i][j] = V[i][j];
}
}
if(C == 1){
for(int i = 0; i < row-1; i++){
col += V[i][0];
}
return;
}
}
void changeH(int P, int Q, int W) {
if(col == 1){
sum += W - h[P][Q];
h[P][Q] = W;
return;
}
}
void changeV(int P, int Q, int W) {
if(col == 1){
sum += W - v[P][Q];
v[P][Q] = W;
return;
}
}
int escape(int V1, int V2) {
if(col == 1){
return sum;
}
}
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... |