oj.uz

Submission #658837

# Submission time Handle Problem Language Result Execution time Memory
658837 2022-11-15T02:57:49 Z aebov T-Covering (eJOI19_covering) C++17
100 / 100
 289 ms 52852 KB 
    #pragma GCC optimize("Ofast")
    #pragma GCC optimize("unroll-loops")
    #pragma GCC optimize("O3")
    #pragma GCC optimize("fast-math")
    #include<iostream>
    #include<vector>
    #include<algorithm>
    #include<cstring>
    #include<map>
    #include<set>
    #include<queue>
    #define ll long long
    #define pb push_back
    #define pll pair<ll ,ll>
    #define F first
    #define S second
    #define pii pair<int ,int>
    using namespace std;
     
    const int N = (int)1e6 + 6;
    int n, m, k, x, y, g[N], v, u,  okt;
    vector<int> vc, adj[N];
    int hx[] = {0, 0, -1, 1};
    int hy[] = {-1, 1, 0, 0};
    ll ans = 0LL;
    bool vis[N], ok[N];
     
    bool valid(int i,int j){return (i >= 0 && i < n && j >= 0 && j < m);}
    void dfs(int v){
    	vis[v] = 1;
    	if(!ok[v])vc.pb(g[v]);
    	else okt ++;
    	for(auto u : adj[v])if(!vis[u])dfs(u);
    }
    int main(){
    	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    	cin >> n >> m;
    	for(int i = 0; i < n; i ++)for(int j = 0; j < m;j ++)cin >> g[i*m + j];
    	cin >> k;
    	for(int i = 0; i < k; i ++){
    		cin >> x >> y;
    		int v = x*m + y;
    	//	cout << "V : " << v << endl;
    		ok[v] = 1, ans += g[v];
    		for(int r = 0; r < 4; r ++){
    			int xx = x + hx[r], yy = y + hy[r];
    			if(!valid(xx, yy))continue;
    			int u = xx * m + yy;
    			adj[v].pb(u), adj[u].pb(v);
    	//		cout << " adj : " <<u << " " << v << endl;
    		}
    	}
    	for(int i = 0; i < n; i ++){
    		for(int j = 0; j < m; j ++){
    			v = i*m + j;
    			if(!vis[v] && ok[v]){
    				okt = 0;
    				vc.clear();
    				dfs(v);
    				if(vc.size() < 3 * okt)return cout << "No", 0;
    				sort(vc.begin(), vc.end());
    	//			cout << i << " " << j << " : " ;
        //          for(auto x : vc)cout << x << " ";
       //           cout << endl;
    				for(int f = 1; f <= 3*okt; f ++)ans += vc[vc.size() - f];
    			}
    		}
    	}return cout << ans << "\n" , 0;
    }

Compilation message

covering.cpp: In function 'int main()':
covering.cpp:60:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   60 |         if(vc.size() < 3 * okt)return cout << "No", 0;
      |            ~~~~~~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 16 ms 24012 KB Output is correct
3 Correct 20 ms 24316 KB Output is correct
4 Correct 35 ms 25540 KB Output is correct
5 Correct 73 ms 29708 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 17 ms 23916 KB Output is correct
3 Correct 22 ms 24336 KB Output is correct
4 Correct 32 ms 25560 KB Output is correct
5 Correct 109 ms 29796 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23764 KB Output is correct
2 Correct 16 ms 23892 KB Output is correct
3 Correct 19 ms 24424 KB Output is correct
4 Correct 32 ms 25628 KB Output is correct
5 Correct 73 ms 29768 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 15 ms 23764 KB Output is correct
3 Correct 22 ms 23964 KB Output is correct
4 Correct 18 ms 24020 KB Output is correct
5 Correct 29 ms 24268 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23820 KB Output is correct
2 Correct 17 ms 23724 KB Output is correct
3 Correct 15 ms 23716 KB Output is correct
4 Correct 15 ms 23748 KB Output is correct
5 Correct 14 ms 23780 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 16 ms 24012 KB Output is correct
3 Correct 20 ms 24316 KB Output is correct
4 Correct 35 ms 25540 KB Output is correct
5 Correct 73 ms 29708 KB Output is correct
6 Correct 14 ms 23764 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 22 ms 24336 KB Output is correct
9 Correct 32 ms 25560 KB Output is correct
10 Correct 109 ms 29796 KB Output is correct
11 Correct 17 ms 23764 KB Output is correct
12 Correct 16 ms 23892 KB Output is correct
13 Correct 19 ms 24424 KB Output is correct
14 Correct 32 ms 25628 KB Output is correct
15 Correct 73 ms 29768 KB Output is correct
16 Correct 15 ms 23764 KB Output is correct
17 Correct 15 ms 23764 KB Output is correct
18 Correct 22 ms 23964 KB Output is correct
19 Correct 18 ms 24020 KB Output is correct
20 Correct 29 ms 24268 KB Output is correct
21 Correct 14 ms 23892 KB Output is correct
22 Correct 17 ms 23892 KB Output is correct
23 Correct 24 ms 24336 KB Output is correct
24 Correct 41 ms 25588 KB Output is correct
25 Correct 82 ms 29708 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 16 ms 24012 KB Output is correct
3 Correct 20 ms 24316 KB Output is correct
4 Correct 35 ms 25540 KB Output is correct
5 Correct 73 ms 29708 KB Output is correct
6 Correct 14 ms 23764 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 22 ms 24336 KB Output is correct
9 Correct 32 ms 25560 KB Output is correct
10 Correct 109 ms 29796 KB Output is correct
11 Correct 17 ms 23764 KB Output is correct
12 Correct 16 ms 23892 KB Output is correct
13 Correct 19 ms 24424 KB Output is correct
14 Correct 32 ms 25628 KB Output is correct
15 Correct 73 ms 29768 KB Output is correct
16 Correct 15 ms 23764 KB Output is correct
17 Correct 15 ms 23764 KB Output is correct
18 Correct 22 ms 23964 KB Output is correct
19 Correct 18 ms 24020 KB Output is correct
20 Correct 29 ms 24268 KB Output is correct
21 Correct 14 ms 23820 KB Output is correct
22 Correct 17 ms 23724 KB Output is correct
23 Correct 15 ms 23716 KB Output is correct
24 Correct 15 ms 23748 KB Output is correct
25 Correct 14 ms 23780 KB Output is correct
26 Correct 14 ms 23892 KB Output is correct
27 Correct 17 ms 23892 KB Output is correct
28 Correct 24 ms 24336 KB Output is correct
29 Correct 41 ms 25588 KB Output is correct
30 Correct 82 ms 29708 KB Output is correct
31 Correct 289 ms 52852 KB Output is correct
32 Correct 74 ms 30776 KB Output is correct
33 Correct 89 ms 31884 KB Output is correct
34 Correct 76 ms 30312 KB Output is correct
35 Correct 146 ms 41312 KB Output is correct