oj.uz

Submission #842450

# Submission time Handle Problem Language Result Execution time Memory
842450 2023-09-02T22:10:14 Z pera T-Covering (eJOI19_covering) C++17
25 / 100
 80 ms 47592 KB 
#include<bits/stdc++.h>
using namespace std;
 
#define int long long
 
const int N = 1e6 + 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(){
	scanf("%lld%lld" , &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 ++){
			scanf("%lld" , &a[i][j]);
		}
	}
	int sp;
	scanf("%lld" , &sp);
	for(int i = 1;i <= sp;i ++){
		int x , y;
		scanf("%lld%lld" , &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){
					printf("%s" , "NO");
					return 0;
				}
				assert(all.size() >= spc * 3);
				sort(all.rbegin() , all.rend());
				for(int k = 0;k < spc * 3;k ++){
					ans += all[k];
				}
			}
		}
	}
	printf("%lld" , ans);
}

Compilation message

covering.cpp:15:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   15 | main(){
      | ^~~~
covering.cpp: In function 'int main()':
covering.cpp:58:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |      for(int k = 0;k < g[vl].size();k ++){
      |                    ~~^~~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from covering.cpp:1:
covering.cpp:72:23: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   72 |     assert(all.size() >= spc * 3);
      |            ~~~~~~~~~~~^~~~~~~~~~
covering.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |  scanf("%lld%lld" , &n , &m);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
covering.cpp:24:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |    scanf("%lld" , &a[i][j]);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~
covering.cpp:28:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |  scanf("%lld" , &sp);
      |  ~~~~~^~~~~~~~~~~~~~
covering.cpp:31:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |   scanf("%lld%lld" , &x , &y);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 24160 KB Output is correct
2 Correct 9 ms 24428 KB Output is correct
3 Correct 13 ms 26120 KB Output is correct
4 Correct 28 ms 30984 KB Output is correct
5 Correct 80 ms 47424 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 24152 KB Output is correct
2 Incorrect 8 ms 24668 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 24156 KB Output is correct
2 Correct 8 ms 24664 KB Output is correct
3 Correct 14 ms 26200 KB Output is correct
4 Correct 29 ms 31116 KB Output is correct
5 Correct 78 ms 47592 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23900 KB Output is correct
2 Correct 5 ms 23940 KB Output is correct
3 Correct 9 ms 24920 KB Output is correct
4 Correct 8 ms 24564 KB Output is correct
5 Correct 16 ms 26204 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23900 KB Output is correct
2 Incorrect 5 ms 23908 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 24160 KB Output is correct
2 Correct 9 ms 24428 KB Output is correct
3 Correct 13 ms 26120 KB Output is correct
4 Correct 28 ms 30984 KB Output is correct
5 Correct 80 ms 47424 KB Output is correct
6 Correct 6 ms 24152 KB Output is correct
7 Incorrect 8 ms 24668 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 24160 KB Output is correct
2 Correct 9 ms 24428 KB Output is correct
3 Correct 13 ms 26120 KB Output is correct
4 Correct 28 ms 30984 KB Output is correct
5 Correct 80 ms 47424 KB Output is correct
6 Correct 6 ms 24152 KB Output is correct
7 Incorrect 8 ms 24668 KB Output isn't correct
8 Halted 0 ms 0 KB -