제출 #658815

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
658815		aebov	T-Covering (eJOI19_covering)	C++14	25 / 100	200 ms	33680 KiB

covering

#include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define pb push_back
#define F first
#define S second
#define pii pair<int ,int>
using namespace std;

const int N = (int)1e6 + 6;
int n, m, k, g[N], okt = 0;
vector<int> vc, adj[N];
int hx[] = {-1, 1, 0, 0};
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])continue;
		dfs(u);
	}
}
int32_t 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 ++){
			int v = i*m +j;
			cin >> g[v];
            ok[v] = vis[v] = 0;
		}
	cin >> k;
	int ans = 0;
	for(int i = 0; i < k; i ++){
		int rr, c;cin >> rr >> c;
		int v = rr*m + c;
	//	cout << "V : " << v << endl;
		ok[v] = 1, ans += g[v];
		for(int r = 0; r < 4; r ++){
			int xx = rr + hx[r], yy = c + hy[r];
			if(valid(xx, yy) == 0)continue;
			int u = (xx*m) + yy;
			adj[v].pb(u);
            adj[u].pb(v);
	//		cout << " adj : " <<u << " " << v << endl;
		}
	}
	for(int r = 0; r < n; r ++){
		for(int c = 0; c < m; c ++){
			int v = r*m + c;
			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];
			}
		}
	}
    cout << ans << "\n";
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

covering.cpp: In function 'int32_t main()':
covering.cpp:60:18: 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]
   60 |     if(vc.size() < 3 * okt)return cout << "NO\n", 0;
      |        ~~~~~~~~~~^~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 30