oj.uz

Submission #658809

# Submission time Handle Problem Language Result Execution time Memory
658809 2022-11-15T02:25:57 Z aebov T-Covering (eJOI19_covering) C++17
25 / 100
 88 ms 33700 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;
ll int n, m, k, x, y, g[N], v, u,  okt;
vector<ll int> vc, adj[N];
ll int hx[] = {-1, 1, 0, 0};
ll int hy[] = {0, 0, 1, -1};
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], ok[i*m + j] = vis[i*m + j] = 0;
	cin >> k;
	ll ans = 0;
	for(int i = 0; i < k; i ++){
		cin >> x >> y;
		ll int v = x*m + y;
	//	cout << "V : " << v << endl;
		ok[v] = 1, ans += g[v];
		for(int r = 0; r < 4; r ++){
			ll int xx = x + hx[r], yy = y + hy[r];
			if(valid(xx, yy) == 0)continue;
			ll 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\n", 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:18: 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]
   60 |     if(vc.size() < 3 * okt)return cout << "NO\n", 0;
      |        ~~~~~~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23820 KB Output is correct
2 Correct 16 ms 24020 KB Output is correct
3 Correct 20 ms 24800 KB Output is correct
4 Correct 32 ms 26700 KB Output is correct
5 Correct 88 ms 33700 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23892 KB Output is correct
2 Incorrect 16 ms 24020 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 14 ms 23856 KB Output is correct
2 Correct 17 ms 24016 KB Output is correct
3 Correct 21 ms 24692 KB Output is correct
4 Correct 37 ms 26764 KB Output is correct
5 Correct 77 ms 33664 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 18 ms 23808 KB Output is correct
3 Correct 22 ms 24320 KB Output is correct
4 Correct 18 ms 24144 KB Output is correct
5 Correct 20 ms 24908 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23816 KB Output is correct
2 Incorrect 13 ms 23808 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23820 KB Output is correct
2 Correct 16 ms 24020 KB Output is correct
3 Correct 20 ms 24800 KB Output is correct
4 Correct 32 ms 26700 KB Output is correct
5 Correct 88 ms 33700 KB Output is correct
6 Correct 18 ms 23892 KB Output is correct
7 Incorrect 16 ms 24020 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23820 KB Output is correct
2 Correct 16 ms 24020 KB Output is correct
3 Correct 20 ms 24800 KB Output is correct
4 Correct 32 ms 26700 KB Output is correct
5 Correct 88 ms 33700 KB Output is correct
6 Correct 18 ms 23892 KB Output is correct
7 Incorrect 16 ms 24020 KB Output isn't correct
8 Halted 0 ms 0 KB -