Submission #997533

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
997533	2024-06-12T13:10:32 Z	hengliao	Portal (BOI24_portal)	C++17	11 / 100	34 ms	6484 KB

Main

#include<bits/stdc++.h>
#include <chrono>
#include <random>
using namespace std;

#define F first
#define S second
#define pb push_back
#define vll vector<ll>
#define pll pair<ll, ll>
typedef long long ll;

struct P{
    ll x, y;

    bool operator< (const P &tar) const{
        if(x!=tar.x){
            return x<tar.x;
        }
        return y<tar.y;
    }
};

void solve(){
	ll n;
    cin>>n;
    vector<P> p(n);
    for(auto &it:p){
        cin>>it.x>>it.y;
    }
    if(n==1){
        cout<<"-1\n";
        return;
    }
    sort(p.begin(), p.end());
    set<ll> st;
    for(auto &it:p){
        st.insert(it.x);
    }
    if(st.size()<=1){
        cout<<"-1\n";
        return;
    }
    ll gcd1=(*prev(st.end()))-(*st.begin());
    ll pre=(*st.begin());
    for(auto &it:st){
        if(it==*st.begin()) continue;
        gcd1=__gcd(gcd1, it-pre);
        pre=it;
    }
    st.clear();
    for(auto &it:p){
        st.insert(it.y);
    }
    if(st.size()<=1){
        cout<<"-1\n";
        return;
    }
    ll gcd2=(*prev(st.end()))-(*st.begin());
    pre=(*st.begin());
    for(auto &it:st){
        if(it==*st.begin()) continue;
        gcd2=__gcd(gcd2, it-pre);
        pre=it;
    }
    bool type1=1;
    pll comp={(p[1].x-p[0].x), (p[1].y-p[0].y)};
    //cout<<comp.F<<' '<<comp.S<<'\n';
    for(ll i=2;i<n;i++){
        ll f=(p[i].x-p[0].x);
        ll s=(p[i].y-p[0].y);
        if(f*comp.S!=s*comp.F){
            //cout<<f<<' '<<s<<'\n';
            type1=0;
            break;
        }
    }
    if(type1){
        cout<<"-1\n";
        return;
    }
    bool type2=1;
    for(ll i=1;i<n;i++){
        ll f=abs(p[i].x-p[0].x)/gcd1;
        ll s=abs(p[i].y-p[0].y)/gcd2;
        if((abs(f+s))%2!=0){
            type2=0;
            break;
        }
    }
    if(type2){
        cout<<gcd1*gcd2*2<<'\n';
        return;
    }
    cout<<gcd1*gcd2<<'\n';
    return;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

	solve();
	return 0;
}

Subtask #1
1.0 / 1.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	Correct	0 ms	348 KB	Output is correct
5	Correct	1 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	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 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	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 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	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 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	0 ms	348 KB	Output is correct
20	Incorrect	0 ms	348 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	23 ms	2036 KB	Output is correct
3	Correct	22 ms	1884 KB	Output is correct
4	Correct	22 ms	1880 KB	Output is correct
5	Correct	25 ms	1884 KB	Output is correct
6	Correct	23 ms	1880 KB	Output is correct
7	Correct	34 ms	6484 KB	Output is correct
8	Correct	34 ms	6484 KB	Output is correct
9	Correct	34 ms	6484 KB	Output is correct
10	Correct	28 ms	4324 KB	Output is correct
11	Correct	29 ms	4188 KB	Output is correct
12	Correct	30 ms	4136 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	22 ms	2012 KB	Output is correct
15	Correct	23 ms	2032 KB	Output is correct
16	Correct	23 ms	2032 KB	Output is correct
17	Correct	22 ms	1880 KB	Output is correct
18	Correct	24 ms	1884 KB	Output is correct
19	Correct	24 ms	1884 KB	Output is correct
20	Correct	22 ms	1884 KB	Output is correct

Subtask #4
0 / 29.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Incorrect	348 KB	Output isn't correct
6	Halted	0 KB	-

Subtask #5
0 / 15.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	Correct	0 ms	348 KB	Output is correct
5	Correct	1 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	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 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	0 ms	348 KB	Output is correct
20	Incorrect	0 ms	348 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	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 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	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 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	0 ms	348 KB	Output is correct
20	Incorrect	0 ms	348 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Submission #997533

Compilation message

Subtask #1 1.0 / 1.0

Subtask #2 0 / 10.0

Subtask #3 10.0 / 10.0

Subtask #4 0 / 29.0

Subtask #5 0 / 15.0

Subtask #6 0 / 35.0

Subtask #1
1.0 / 1.0

Subtask #2
0 / 10.0

Subtask #3
10.0 / 10.0

Subtask #4
0 / 29.0

Subtask #5
0 / 15.0

Subtask #6
0 / 35.0