# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
464452 | AdamGS | Game (eJOI20_game) | C++14 | 1 ms | 352 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;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=30;
vector<pair<int,int>>V[LIM][LIM];
int odw[LIM][LIM], ile=0, kraw[LIM][LIM];
void DFS(int a, int b) {
++ile;
odw[a][b]=1;
for(auto i : V[a][b]) if(!odw[i.st][i.nd]) DFS(i.st, i.nd);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, m;
cin >> n >> m;
string s;
cin >> s;
rep(j, m) {
if(s[j]=='0') {
++kraw[0][j];
}
}
rep(i, n-1) {
cin >> s;
# | 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... |