oj.uz

Submission #639737

# Submission time Handle Problem Language Result Execution time Memory
639737 2022-09-11T11:26:44 Z ShirleyM T-Covering (eJOI19_covering) C++14
100 / 100
 331 ms 59060 KB 
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<vvii> vvvii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
#define x first
#define y second
#define pb push_back
#define loop(i,s,e) for(int i=s;i<e;i++)
#define loopr(i,s,e) for(int i=e-1;i>=s;i--)
#define chkmax(a,b) a=max(a,b)
#define chkmin(a,b) a=min(a,b)
#define all(a) a.begin(),a.end()
#define fast {ios_base::sync_with_stdio(false); cin.tie(0);}
const int inf = 1e11;
const int INF = 1e9;
const int mod = 1e9+7;
const int sz = 1e6;

int n,m,k;
int g[sz];
bool s[sz];
bool vis[sz];
vi adj[sz];
int cnt_s=0;
vi vals;

inline bool in_limits(int i, int j){
    return (i>=0 && i<n && j>=0 && j<m);
}

void dfs(int v){
    vis[v]=1;
    if(!s[v]) vals.pb(g[v]);
    else cnt_s++;
    for(auto u:adj[v]){
        if(vis[u]) continue;
        dfs(u);
    }
}

int32_t main() {
    fast;
    cin >> n >> m;
    loop(i,0,n){
        loop(j,0,m){
            int v = i*m+j;
            cin >> g[v];
            s[v]=vis[v]=0;
        }
    }
    cin >> k;
    int ans=0;
    loop(i,0,k){
        int r,c; cin >> r >>c;
        int v= r*m+c;
        s[v]=true;
        ans+=g[v];
        vii d = {{-1,0}, {1,0}, {0,1}, {0,-1}};
        for(auto it:d) {
            int di = it.x, dj = it.y;
            int ni = r + di, nj = c + dj;
            int u = ni*m+nj;
            if (!in_limits(ni, nj)) continue;
            adj[v].pb(u);
            adj[u].pb(v);
        }
    }
    loop(r,0,n){
        loop(c,0,m){
            int v = r*m+c;
            if(!vis[v] && s[v]){
                cnt_s=0;
                vals.clear();
                dfs(v);
                if(vals.size() < 3*cnt_s){
                    cout << "No";
                    return 0;
                }
                sort(all(vals));
                loop(i,1,3*cnt_s+1) ans+=vals[vals.size()-i];
            }
        }
    }
    cout << ans;
    return 0;
}

Compilation message

covering.cpp: In function 'int32_t main()':
covering.cpp:83:32: warning: comparison of integer expressions of different signedness: 'std::vector<long int>::size_type' {aka 'long unsigned int'} and 'int64_t' {aka 'long int'} [-Wsign-compare]
   83 |                 if(vals.size() < 3*cnt_s){
      |                    ~~~~~~~~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 14 ms 24092 KB Output is correct
3 Correct 23 ms 24816 KB Output is correct
4 Correct 35 ms 26716 KB Output is correct
5 Correct 85 ms 33700 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 14 ms 24052 KB Output is correct
3 Correct 18 ms 24712 KB Output is correct
4 Correct 31 ms 26780 KB Output is correct
5 Correct 74 ms 33688 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23928 KB Output is correct
2 Correct 13 ms 24020 KB Output is correct
3 Correct 18 ms 24700 KB Output is correct
4 Correct 32 ms 26784 KB Output is correct
5 Correct 75 ms 33624 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23772 KB Output is correct
2 Correct 13 ms 23788 KB Output is correct
3 Correct 15 ms 24276 KB Output is correct
4 Correct 14 ms 24148 KB Output is correct
5 Correct 20 ms 24924 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23772 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23816 KB Output is correct
4 Correct 14 ms 23788 KB Output is correct
5 Correct 14 ms 23708 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 14 ms 24092 KB Output is correct
3 Correct 23 ms 24816 KB Output is correct
4 Correct 35 ms 26716 KB Output is correct
5 Correct 85 ms 33700 KB Output is correct
6 Correct 12 ms 23892 KB Output is correct
7 Correct 14 ms 24052 KB Output is correct
8 Correct 18 ms 24712 KB Output is correct
9 Correct 31 ms 26780 KB Output is correct
10 Correct 74 ms 33688 KB Output is correct
11 Correct 12 ms 23928 KB Output is correct
12 Correct 13 ms 24020 KB Output is correct
13 Correct 18 ms 24700 KB Output is correct
14 Correct 32 ms 26784 KB Output is correct
15 Correct 75 ms 33624 KB Output is correct
16 Correct 13 ms 23772 KB Output is correct
17 Correct 13 ms 23788 KB Output is correct
18 Correct 15 ms 24276 KB Output is correct
19 Correct 14 ms 24148 KB Output is correct
20 Correct 20 ms 24924 KB Output is correct
21 Correct 14 ms 23912 KB Output is correct
22 Correct 17 ms 24128 KB Output is correct
23 Correct 18 ms 24764 KB Output is correct
24 Correct 31 ms 26812 KB Output is correct
25 Correct 78 ms 33672 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 14 ms 24092 KB Output is correct
3 Correct 23 ms 24816 KB Output is correct
4 Correct 35 ms 26716 KB Output is correct
5 Correct 85 ms 33700 KB Output is correct
6 Correct 12 ms 23892 KB Output is correct
7 Correct 14 ms 24052 KB Output is correct
8 Correct 18 ms 24712 KB Output is correct
9 Correct 31 ms 26780 KB Output is correct
10 Correct 74 ms 33688 KB Output is correct
11 Correct 12 ms 23928 KB Output is correct
12 Correct 13 ms 24020 KB Output is correct
13 Correct 18 ms 24700 KB Output is correct
14 Correct 32 ms 26784 KB Output is correct
15 Correct 75 ms 33624 KB Output is correct
16 Correct 13 ms 23772 KB Output is correct
17 Correct 13 ms 23788 KB Output is correct
18 Correct 15 ms 24276 KB Output is correct
19 Correct 14 ms 24148 KB Output is correct
20 Correct 20 ms 24924 KB Output is correct
21 Correct 12 ms 23772 KB Output is correct
22 Correct 12 ms 23764 KB Output is correct
23 Correct 12 ms 23816 KB Output is correct
24 Correct 14 ms 23788 KB Output is correct
25 Correct 14 ms 23708 KB Output is correct
26 Correct 14 ms 23912 KB Output is correct
27 Correct 17 ms 24128 KB Output is correct
28 Correct 18 ms 24764 KB Output is correct
29 Correct 31 ms 26812 KB Output is correct
30 Correct 78 ms 33672 KB Output is correct
31 Correct 331 ms 59060 KB Output is correct
32 Correct 100 ms 34744 KB Output is correct
33 Correct 86 ms 35744 KB Output is correct
34 Correct 78 ms 34580 KB Output is correct
35 Correct 168 ms 46160 KB Output is correct