oj.uz

Submission #994755

# Submission time Handle Problem Language Result Execution time Memory
994755 2024-06-08T04:55:36 Z emptypringlescan Portal (BOI24_portal) C++17
1 / 100
 1276 ms 1048576 KB 
    #include <bits/stdc++.h>
    using namespace std;
    int grid[255][255];
    vector<pair<int,int> > step;
    void dfs(int x, int y){
    	if(x<0||x>250||y<0||y>250) return;
    	if(grid[x][y]) return;
    	grid[x][y]=1;
    	for(pair<int,int> i:step){
    		if(x+i.first>=0&&x+i.first<=250&&y+i.second>=0&&y+i.second<=250){
    			if(grid[x+i.first][y+i.second]==0) dfs(x+i.first,y+i.second);
    		}
    	}
    }
    int32_t main(){
    	ios::sync_with_stdio(0);
    	cin.tie(0);
    	int n;
    	cin >> n;
    	pair<int,int> arr[n];
    	for(int i=0; i<n; i++) cin >> arr[i].first >> arr[i].second;
    	if(n==2||n==1) cout << -1;
    	else{
    		for(int i=0; i<n; i++){
    			for(int j=0; j<n; j++){
    				if(i==j) continue;
    				step.push_back({arr[i].first-arr[j].first,arr[i].second-arr[j].second});
    			}
    		}
    		int cnt=0;
    		for(int i=0; i<250; i++){
    			for(int j=0; j<250; j++){
    				if(grid[i][j]) continue;
    				cnt++;
    				dfs(i,j);
    			}
    		}
    		cout << (cnt>40000?-1:cnt);
    	}
    }

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 2 ms 1372 KB Output is correct
20 Incorrect 1 ms 604 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Runtime error 756 ms 1048576 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1372 KB Output is correct
2 Correct 5 ms 3664 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 1143 ms 1628 KB Output is correct
5 Correct 1210 ms 892 KB Output is correct
6 Correct 1276 ms 944 KB Output is correct
7 Correct 1151 ms 1140 KB Output is correct
8 Correct 1146 ms 1112 KB Output is correct
9 Incorrect 9 ms 600 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 2 ms 1372 KB Output is correct
20 Incorrect 1 ms 604 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 2 ms 1372 KB Output is correct
20 Incorrect 1 ms 604 KB Output isn't correct
21 Halted 0 ms 0 KB -