| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1347129 | nicolo_010 | 웜뱃 (IOI13_wombats) | C++20 | 26 ms | 12100 KiB |
#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int sm=0;
int n, m;
int v[5000][200];
void init(int R, int C, int H[5000][200], int V[5000][200]) {
n = R;
m = C;
sm=0;
for (int i=0; i<n; i++) {
for (int j=0; j<m; j++) {
v[i][j] = V[i][j];
}
}
for (int i=0; i<n-1; i++) {
sm += v[i][0];
}
}
void changeH(int P, int Q, int W) {
}
void changeV(int P, int Q, int W) {
sm -= v[P][Q];
v[P][Q] = W;
sm += W;
}
int escape(int V1, int V2) {
return sm;
}
| # | 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... | ||||
