Submission #248754

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
248754	2020-07-13T10:02:42 Z	proma	T-Covering (eJOI19_covering)	C++17	70 / 100	1000 ms	102400 KB

covering

#include <bits/stdc++.h>
#define endl "\n"
//#define int long long
#define see(x) cerr<<#x<<"="<<x<<endl;

using namespace std;

const int N = 1002;

int m, n, k, used[N*N], cnt, ans, val[N*N], spec[N*N];
map <pair <int, int>, int> def;
vector <int> g[N*N], values;

void dfs (int v) {
	used[v] = 1;
	if (spec[v]) ++ cnt;
	else values.push_back(val[v]);

	for (auto i: g[v])
		if (!used[i]) dfs(i);
}

int32_t main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> m >> n;

    int temp = 1;
    for (int i = 0; i < m; ++ i)
    	for (int j = 0; j < n; ++ j) {
    		int a; cin >> a;
    		val[temp] = a;
    		def[{i, j}] = temp ++;
    	}

   	cin >> k;

   	for (int i = 0; i < k; ++ i) {
   		int x, y;
   		cin >> x >> y;
   		ans += val[def[{x,y}]];
   		spec[def[{x,y}]] = 1;
   		if (x) {
   			g[def[{x,y}]].push_back(def[{x-1,y}]);
   			g[def[{x-1,y}]].push_back(def[{x,y}]);
   		}
   		if (y) {
   			g[def[{x,y}]].push_back(def[{x,y-1}]);
   			g[def[{x,y-1}]].push_back(def[{x,y}]);
   		}
   		if (x < m-1) {
   			g[def[{x,y}]].push_back(def[{x+1,y}]);
   			g[def[{x+1,y}]].push_back(def[{x,y}]);
   		}
   		if (y < n-1) {
   			g[def[{x,y}]].push_back(def[{x,y+1}]);
   			g[def[{x,y+1}]].push_back(def[{x,y}]);
   		}
   	}

   	temp = 1;
   	for (int i = 0; i < m; ++ i)
   		for (int j = 0; j < n; ++ j) {
   			if (!used[temp]) {
   				values.clear();
   				cnt = 0;
   				dfs(temp);
   				sort(values.rbegin(), values.rend());
   				if (3*cnt > values.size()) {
   					cout << "No\n";
   					return 0;
   				}
   				for (int k = 0; k < 3*cnt; ++ k)
   					ans += values[k];
   			}
   			++ temp;
   		}

   	cout << ans << endl;

    return 0;
}

Compilation message

covering.cpp: In function 'int32_t main()':
covering.cpp:30:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for (int i = 0; i < m; ++ i)
     ^~~
covering.cpp:37:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     cin >> k;
     ^~~
covering.cpp:70:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
        if (3*cnt > values.size()) {
            ~~~~~~^~~~~~~~~~~~~~~

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	24700 KB	Output is correct
2	Correct	24 ms	26112 KB	Output is correct
3	Correct	56 ms	31224 KB	Output is correct
4	Correct	127 ms	46072 KB	Output is correct
5	Correct	413 ms	100856 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	24704 KB	Output is correct
2	Correct	23 ms	26112 KB	Output is correct
3	Correct	50 ms	31224 KB	Output is correct
4	Correct	127 ms	46072 KB	Output is correct
5	Correct	422 ms	100856 KB	Output is correct

Subtask #3

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	24704 KB	Output is correct
2	Correct	24 ms	26104 KB	Output is correct
3	Correct	48 ms	31224 KB	Output is correct
4	Correct	129 ms	46052 KB	Output is correct
5	Correct	419 ms	100856 KB	Output is correct

Subtask #4

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	14 ms	24064 KB	Output is correct
2	Correct	14 ms	24064 KB	Output is correct
3	Correct	31 ms	27512 KB	Output is correct
4	Correct	26 ms	26112 KB	Output is correct
5	Correct	56 ms	31224 KB	Output is correct

Subtask #5

15.0 / 15.0

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

Subtask #6

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	24700 KB	Output is correct
2	Correct	24 ms	26112 KB	Output is correct
3	Correct	56 ms	31224 KB	Output is correct
4	Correct	127 ms	46072 KB	Output is correct
5	Correct	413 ms	100856 KB	Output is correct
6	Correct	17 ms	24704 KB	Output is correct
7	Correct	23 ms	26112 KB	Output is correct
8	Correct	50 ms	31224 KB	Output is correct
9	Correct	127 ms	46072 KB	Output is correct
10	Correct	422 ms	100856 KB	Output is correct
11	Correct	17 ms	24704 KB	Output is correct
12	Correct	24 ms	26104 KB	Output is correct
13	Correct	48 ms	31224 KB	Output is correct
14	Correct	129 ms	46052 KB	Output is correct
15	Correct	419 ms	100856 KB	Output is correct
16	Correct	14 ms	24064 KB	Output is correct
17	Correct	14 ms	24064 KB	Output is correct
18	Correct	31 ms	27512 KB	Output is correct
19	Correct	26 ms	26112 KB	Output is correct
20	Correct	56 ms	31224 KB	Output is correct
21	Correct	17 ms	24876 KB	Output is correct
22	Correct	26 ms	26240 KB	Output is correct
23	Correct	52 ms	31864 KB	Output is correct
24	Correct	130 ms	47352 KB	Output is correct
25	Correct	418 ms	100856 KB	Output is correct

Subtask #7

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	24700 KB	Output is correct
2	Correct	24 ms	26112 KB	Output is correct
3	Correct	56 ms	31224 KB	Output is correct
4	Correct	127 ms	46072 KB	Output is correct
5	Correct	413 ms	100856 KB	Output is correct
6	Correct	17 ms	24704 KB	Output is correct
7	Correct	23 ms	26112 KB	Output is correct
8	Correct	50 ms	31224 KB	Output is correct
9	Correct	127 ms	46072 KB	Output is correct
10	Correct	422 ms	100856 KB	Output is correct
11	Correct	17 ms	24704 KB	Output is correct
12	Correct	24 ms	26104 KB	Output is correct
13	Correct	48 ms	31224 KB	Output is correct
14	Correct	129 ms	46052 KB	Output is correct
15	Correct	419 ms	100856 KB	Output is correct
16	Correct	14 ms	24064 KB	Output is correct
17	Correct	14 ms	24064 KB	Output is correct
18	Correct	31 ms	27512 KB	Output is correct
19	Correct	26 ms	26112 KB	Output is correct
20	Correct	56 ms	31224 KB	Output is correct
21	Correct	14 ms	23936 KB	Output is correct
22	Correct	14 ms	23936 KB	Output is correct
23	Correct	14 ms	23936 KB	Output is correct
24	Correct	14 ms	23984 KB	Output is correct
25	Correct	15 ms	23936 KB	Output is correct
26	Correct	17 ms	24876 KB	Output is correct
27	Correct	26 ms	26240 KB	Output is correct
28	Correct	52 ms	31864 KB	Output is correct
29	Correct	130 ms	47352 KB	Output is correct
30	Correct	418 ms	100856 KB	Output is correct
31	Execution timed out	1092 ms	102400 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-