# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
464468 | amunduzbaev | T-Covering (eJOI19_covering) | C++14 | 282 ms | 43892 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 arr array<int, 2>
void solve(){
int n, m; cin>>n>>m;
vector<vector<int>> a(n, vector<int>(m));
vector<vector<int>> used(n, vector<int>(m));
vector<vector<int>> is(n, vector<int>(m));
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>a[i][j];
}
}
int k; cin>>k;
vector<array<int, 2>> cc(k);
for(int i=0;i<k;i++){
cin>>cc[i][0]>>cc[i][1];
}
for(int i=0;i<k;i++){
is[cc[i][0]][cc[i][1]] = 1;
}
int ch[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
int ch2[4][2] = {{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
for(int i=0;i<k;i++){
is[cc[i][0]][cc[i][1]] = 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |