oj.uz

답안 #833875

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
833875 2023-08-22T09:16:13 Z tolbi T-Covering (eJOI19_covering) C++17
25 / 100
 166 ms 12020 KB 
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
#define tol(bi) (1LL<<((int)(bi)))
int main(){
	int h,w;
	cin>>h>>w;
	vector<vector<int>> val(h,vector<int>(w));
	for (int i = 0; i < h; ++i)
	{
		for (int j = 0; j < w; j++){
			cin>>val[i][j];
		}
	}
	int n;cin>>n;
	vector<vector<int>> arr(h,vector<int>(w,0));
	vector<pair<int,int>> spec(n); 
	for (int i = 0; i < n; i++){
		int x,y;cin>>x>>y;
		arr[x][y]=i+1;
		spec[i]={x,y};
	}
	vector<bool> vis(n,false);
	int ans=0;
	function<int(int)> dfs;
	function<int(int,int)> dallan;
	vector<int> crvis(n,false);
	dallan = [&](int x, int y)->int{
		int rval = 0;
		if (x>0 && arr[x-1][y]>0) {
			int rr = dfs(arr[x-1][y]-1);
			if (rr==-1) return -1;
			rval+=rr;
		}
		if (x+1<h && arr[x+1][y]>0) {
			int rr = dfs(arr[x+1][y]-1);
			if (rr==-1) return -1;
			rval+=rr;
		}
		if (y>0 && arr[x][y-1]>0) {
			int rr = dfs(arr[x][y-1]-1);
			if (rr==-1) return -1;
			rval+=rr;
		}
		if (y+1<w && arr[x][y+1]>0) {
			int rr = dfs(arr[x][y+1]-1);
			if (rr==-1) return -1;
			rval+=rr;
		}
		return rval;
	};
	dfs = [&](int node)->int{
		vis[node]=true;
		if (crvis[node]) return 0;
		crvis[node]=true;
		int x = spec[node].first;
		int y = spec[node].second;
		vector<pair<int,int>> ava;
		if (x>0 && arr[x-1][y]==0) ava.push_back({x-1,y});
		if (y>0 && arr[x][y-1]==0) ava.push_back({x,y-1});
		if (x+1<h && arr[x+1][y]==0) ava.push_back({x+1,y});
		if (y+1<w && arr[x][y+1]==0) ava.push_back({x,y+1});
		if (ava.size()<3){
			crvis[node]=false;
			return -1;
		}
		int rval = -1;
		for (int i = 0; i <= ava.size(); i++){
			int cnt = 0;
			for (int j = 0; j < ava.size(); j++){
				if (i==j) continue;
				cnt++;
			}
			if (cnt!=3) continue;
			int crr = 0;
			for (int j = 0; j < ava.size(); j++){
				if (i==j) continue;
				arr[ava[j].first][ava[j].second]=-23;
				crr+=val[ava[j].first][ava[j].second];
			}
			for (int j = 0; j < ava.size() && crr!=-1; j++){
				if (i==j) continue;
				int crrr = dallan(ava[j].first,ava[j].second);
				if (crrr==-1) crr=-1;
				else{
					crr+=crrr;
				}
			}
			for (int j = 0; j < ava.size(); j++){
				if (i==j) continue;
				arr[ava[j].first][ava[j].second]=0;
			}
			if (crr!=-1) rval=max(rval,crr);
		}
		crvis[node]=false;
		if (rval==-1) return rval;
		return rval+val[x][y];
	};
	for (int i = 0; i < n; i++){
		if (vis[i]) continue;
		int rval = dfs(i);
		if (rval==-1){
			ans=-1;
			break;
		}
		else {
			ans+=rval;
		}
	}
	if (ans==-1){
		cout<<"No"<<endl;
	}
	else cout<<ans<<endl;
}

Compilation message

covering.cpp: In lambda function:
covering.cpp:68:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |   for (int i = 0; i <= ava.size(); i++){
      |                   ~~^~~~~~~~~~~~~
covering.cpp:70:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |    for (int j = 0; j < ava.size(); j++){
      |                    ~~^~~~~~~~~~~~
covering.cpp:76:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |    for (int j = 0; j < ava.size(); j++){
      |                    ~~^~~~~~~~~~~~
covering.cpp:81:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |    for (int j = 0; j < ava.size() && crr!=-1; j++){
      |                    ~~^~~~~~~~~~~~
covering.cpp:89:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |    for (int j = 0; j < ava.size(); j++){
      |                    ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 14 ms 1492 KB Output is correct
4 Correct 46 ms 3772 KB Output is correct
5 Correct 141 ms 12020 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 14 ms 1492 KB Output is correct
4 Correct 42 ms 3788 KB Output is correct
5 Correct 144 ms 11900 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 5 ms 660 KB Output is correct
3 Correct 17 ms 1464 KB Output is correct
4 Correct 42 ms 3784 KB Output is correct
5 Correct 166 ms 11896 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 14 ms 1492 KB Output is correct
4 Correct 46 ms 3772 KB Output is correct
5 Correct 141 ms 12020 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 5 ms 596 KB Output is correct
8 Correct 14 ms 1492 KB Output is correct
9 Correct 42 ms 3788 KB Output is correct
10 Correct 144 ms 11900 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 5 ms 660 KB Output is correct
13 Correct 17 ms 1464 KB Output is correct
14 Correct 42 ms 3784 KB Output is correct
15 Correct 166 ms 11896 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Incorrect 1 ms 212 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 14 ms 1492 KB Output is correct
4 Correct 46 ms 3772 KB Output is correct
5 Correct 141 ms 12020 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 5 ms 596 KB Output is correct
8 Correct 14 ms 1492 KB Output is correct
9 Correct 42 ms 3788 KB Output is correct
10 Correct 144 ms 11900 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 5 ms 660 KB Output is correct
13 Correct 17 ms 1464 KB Output is correct
14 Correct 42 ms 3784 KB Output is correct
15 Correct 166 ms 11896 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Incorrect 1 ms 212 KB Output isn't correct
18 Halted 0 ms 0 KB -