oj.uz

Submission #287056

# Submission time Handle Problem Language Result Execution time Memory
287056 2020-08-31T10:42:47 Z wildturtle T-Covering (eJOI19_covering) C++14
100 / 100
 809 ms 59356 KB 
#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);
        }
        if(a<n) {
            v[(a-1)*m+b].push_back(a*m+b);
            v[a*m+b].push_back((a-1)*m+b);
        }
        if(b>1) {
            v[(a-1)*m+b].push_back((a-1)*m+b-1);
            v[(a-1)*m+b-1].push_back((a-1)*m+b);
        }
        if(b<m) {
            v[(a-1)*m+b].push_back((a-1)*m+b+1);
            v[(a-1)*m+b+1].push_back((a-1)*m+b+1);
        }
    }
    for(int i=1;i<=n*m;i++) {
        if(fix[i]==1) continue;
        v1.clear(); l=0;
        dfs(i);
        if(3*l>v1.size()) { cout<<"No"; return 0; }
        sort(v1.begin(),v1.end());
        for(int j=0;j<3*l;j++)
        ans-=v1[j];
    }
    cout<<ans;
}

Compilation message

covering.cpp: In function 'void dfs(int)':
covering.cpp:10:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for(int i=0;i<v[x].size();i++) {
      |                 ~^~~~~~~~~~~~
covering.cpp: In function 'int main()':
covering.cpp:48:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         if(3*l>v1.size()) { cout<<"No"; return 0; }
      |            ~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23928 KB Output is correct
2 Correct 28 ms 24192 KB Output is correct
3 Correct 58 ms 24952 KB Output is correct
4 Correct 142 ms 27216 KB Output is correct
5 Correct 448 ms 34424 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 28 ms 24184 KB Output is correct
3 Correct 59 ms 25336 KB Output is correct
4 Correct 145 ms 28408 KB Output is correct
5 Correct 450 ms 38040 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 28 ms 24192 KB Output is correct
3 Correct 59 ms 24952 KB Output is correct
4 Correct 144 ms 27232 KB Output is correct
5 Correct 446 ms 34296 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23808 KB Output is correct
2 Correct 17 ms 23808 KB Output is correct
3 Correct 38 ms 24184 KB Output is correct
4 Correct 29 ms 24184 KB Output is correct
5 Correct 59 ms 24824 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23808 KB Output is correct
2 Correct 15 ms 23808 KB Output is correct
3 Correct 15 ms 23808 KB Output is correct
4 Correct 15 ms 23808 KB Output is correct
5 Correct 15 ms 23808 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23928 KB Output is correct
2 Correct 28 ms 24192 KB Output is correct
3 Correct 58 ms 24952 KB Output is correct
4 Correct 142 ms 27216 KB Output is correct
5 Correct 448 ms 34424 KB Output is correct
6 Correct 19 ms 23936 KB Output is correct
7 Correct 28 ms 24184 KB Output is correct
8 Correct 59 ms 25336 KB Output is correct
9 Correct 145 ms 28408 KB Output is correct
10 Correct 450 ms 38040 KB Output is correct
11 Correct 19 ms 23936 KB Output is correct
12 Correct 28 ms 24192 KB Output is correct
13 Correct 59 ms 24952 KB Output is correct
14 Correct 144 ms 27232 KB Output is correct
15 Correct 446 ms 34296 KB Output is correct
16 Correct 16 ms 23808 KB Output is correct
17 Correct 17 ms 23808 KB Output is correct
18 Correct 38 ms 24184 KB Output is correct
19 Correct 29 ms 24184 KB Output is correct
20 Correct 59 ms 24824 KB Output is correct
21 Correct 20 ms 23936 KB Output is correct
22 Correct 29 ms 24184 KB Output is correct
23 Correct 59 ms 25340 KB Output is correct
24 Correct 144 ms 28280 KB Output is correct
25 Correct 449 ms 38136 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23928 KB Output is correct
2 Correct 28 ms 24192 KB Output is correct
3 Correct 58 ms 24952 KB Output is correct
4 Correct 142 ms 27216 KB Output is correct
5 Correct 448 ms 34424 KB Output is correct
6 Correct 19 ms 23936 KB Output is correct
7 Correct 28 ms 24184 KB Output is correct
8 Correct 59 ms 25336 KB Output is correct
9 Correct 145 ms 28408 KB Output is correct
10 Correct 450 ms 38040 KB Output is correct
11 Correct 19 ms 23936 KB Output is correct
12 Correct 28 ms 24192 KB Output is correct
13 Correct 59 ms 24952 KB Output is correct
14 Correct 144 ms 27232 KB Output is correct
15 Correct 446 ms 34296 KB Output is correct
16 Correct 16 ms 23808 KB Output is correct
17 Correct 17 ms 23808 KB Output is correct
18 Correct 38 ms 24184 KB Output is correct
19 Correct 29 ms 24184 KB Output is correct
20 Correct 59 ms 24824 KB Output is correct
21 Correct 15 ms 23808 KB Output is correct
22 Correct 15 ms 23808 KB Output is correct
23 Correct 15 ms 23808 KB Output is correct
24 Correct 15 ms 23808 KB Output is correct
25 Correct 15 ms 23808 KB Output is correct
26 Correct 20 ms 23936 KB Output is correct
27 Correct 29 ms 24184 KB Output is correct
28 Correct 59 ms 25340 KB Output is correct
29 Correct 144 ms 28280 KB Output is correct
30 Correct 449 ms 38136 KB Output is correct
31 Correct 809 ms 59356 KB Output is correct
32 Correct 439 ms 35424 KB Output is correct
33 Correct 465 ms 41536 KB Output is correct
34 Correct 448 ms 37240 KB Output is correct
35 Correct 576 ms 51828 KB Output is correct