# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287056 | wildturtle | T-Covering (eJOI19_covering) | C++14 | 809 ms | 59356 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;
int a,b,n,m,k,l,A[1000006],B[1000006],fix[1000006],ans;
vector <int> v1,v[1000006];
void dfs(int x) {
if(fix[x]==1) return;
fix[x]=1;
if(B[x]==1) l++;
else v1.push_back(-A[x]);
for(int i=0;i<v[x].size();i++) {
dfs(v[x][i]);
}
}
int main() {
cin>>n>>m;
for(int i=1;i<=n;i++) {
for(int j=1;j<=m;j++) {
cin>>a;
A[(i-1)*m+j]=a;
}
}
cin>>k;
for(int i=1;i<=k;i++) {
cin>>a>>b;
a++; b++;
B[(a-1)*m+b]=1; ans+=A[(a-1)*m+b];
if(a>1) {
v[(a-1)*m+b].push_back((a-2)*m+b);
v[(a-2)*m+b].push_back((a-1)*m+b);
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |