oj.uz

Submission #994734

# Submission time Handle Problem Language Result Execution time Memory
994734 2024-06-08T04:43:09 Z LCJLY Portal (BOI24_portal) C++14
0 / 100
 750 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;
	
#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef pair<int,pii>pi2;

void solve(){	
	int n;
	cin >> n;
	pii arr[n];
	for(int x=0;x<n;x++){
		cin >> arr[x].first >> arr[x].second;
	}
	
	vector<int>diff;
	vector<int>diff2;
	for(int x=0;x<n;x++){
		for(int y=0;y<n;y++){
			pii hold=arr[x]; //higher
			pii hold2=arr[y];
			if(arr[x].second<arr[y].second) swap(hold,hold2);
			if(hold.second==hold2.second){
				diff.push_back(abs(hold.first-hold2.first));
			}
			else if(hold2.first<hold.first){
				diff.push_back(abs(hold.first-hold2.first));
				diff2.push_back(abs(hold.second-hold2.second)+1);
			}
			else if(hold2.first==hold.first){
				diff2.push_back(abs(hold.second-hold2.second));
			}
			else if(hold2.first>hold.first){
				diff.push_back(abs(hold.first-hold2.first));
				diff2.push_back(abs(hold.second-hold2.second)+1);
			}
		}
	}
	
	if(diff.size()==0||diff2.size()==0){
		cout << -1;
		return;
	}
	int hold=diff[0];
	int hold2=diff2[0];
	for(auto it:diff){
		hold=__gcd(hold,it);
	}
	for(auto it:diff2){
		hold2=__gcd(hold2,it);
	}
	cout << hold*hold2 << "\n";	
}
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//cin >> t;
	//freopen("in.txt","r",stdin);
	while(t--){
		solve();
	}
}

Subtask #1
0 / 1.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 750 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 604 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

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

Subtask #6
0 / 35.0

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