| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 842378 | pera | T-Covering (eJOI19_covering) | C++17 | 73 ms | 94656 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 int long long
const int N = 3e6 + 1;
int dx[4] = {0 , 0 , -1 , 1};
int dy[4] = {1 , -1 , 0 , 0};
int n , m , ans = 0 , ok = 1;
vector<vector<int>> a , v , gd;
vector<int> g[N];
main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin >> n >> m;
a.resize(n) , v.resize(n);
gd.resize(n);
for(int i = 0;i < n;i ++){
a[i].resize(m);
v[i].resize(m);
gd[i].resize(m);
for(int j = 0;j < m;j ++){
cin >> a[i][j];
}
}
int sp;cin >> sp;
for(int i = 1;i <= sp;i ++){
int x , y;cin >> x >> y;
gd[x][y] = 1;
ans += a[x][y];
for(int k = 0;k < 4;k ++){
int I = x + dx[k] , J = y + dy[k];
if(0 <= I && I < n && 0 <= J && J < m){
g[I * m + J].push_back(x * m + y);
g[x * m + y].push_back(I * m + J);
}
}
}
for(int i = 0;i < n;i ++){
for(int j = 0;j < m;j ++){
if(v[i][j] == 0 && gd[i][j] == 1){
int spc = 0 , sz = 0;
queue<int> q;
vector<int> all;
q.push(i * m + j);
v[i][j] = 1;/*
cout << "st: ";*/
while(q.size()){
int vl = q.front();
q.pop();
int I = vl / m , J = vl % m;/*
cout << I << " " << J << endl;*/
spc += gd[I][J];
if(gd[I][J] == 0) all.push_back(a[I][J]);
for(int k = 0;k < g[vl].size();k ++){
if(v[g[vl][k] / m][g[vl][k] % m] == 0){
v[g[vl][k] / m][g[vl][k] % m] = 1;
q.push(g[vl][k]);
}
}
sz ++;
}
/*cout << "---" << endl;
cout << "i , j : " << i << " " << j << " " << sz << endl;*/
if(sz < spc * 4){
cout << "NO" << endl;
return 0;
}
assert(all.size() >= spc * 3);
sort(all.rbegin() , all.rend());
for(int k = 0;k < spc * 3;k ++){
ans += all[k];
}
}
}
}
cout << ans << endl;
}
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... | ||||
