Submission #1264829

#	Time	Username	Problem	Language	Result	Execution time	Memory
1264829		TsotneSV	Portal (BOI24_portal)	C++20	0 / 100	17 ms	1092 KiB

Main

#include <bits/stdc++.h>
using namespace std;
/*⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣤⠀⠀⠀⠀⠀⠀⠀⡄⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣤⣿⠛⣿⠀⠀⠀⠀⣤⣿⢻⡇⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣤⣿⡛⠀⣤⣿⣿⣤⣤⣿⣿⣤⢸⡇⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣴⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⠀
⠀⠀⠀⠀⠀⠀⠀⣶⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡗⠀
⢠⣼⣿⣿⣿⣿⣤⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷
⢸⣿⣿⡟⠛⠛⢿⣿⣿⣿⣿⣿⣿⣿⣤⣤⣤⣿⣿⣿⣿⣤⣤⣼⣿⣿
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⠛⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡟⠋       
*/
#define fi first
#define se second
#define pb push_back
#define ins insert
#define sz(a) (int)(a.size())
#define all(x) (x).begin(),(x).end()
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}

#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
#include "debug.h"
#else
#define debug(...)
#endif

//const int mod = 1e9+7;
//const int mod = 998244353;
const int MAXN=2e5+5; 
const ll inf=1e9,INF=1e18; 

int n;

void solve(int tc = 0){
    cin>>n; vi x(n+1),y(n+1);

    rep(i,1,n+1) cin>>x[i]>>y[i];

    
    if(n < 3) {
        if(x[1] == x[2] or y[1] == y[2] or x[1] + y[1] == x[2] + y[2] or x[1] - y[1] == x[2] - y[2]) {
            print(-1);
        } else {
            print(2);
        } return;
    }
    
    set<int> sx,sy;
    for(int i=1;i<=n;i++) {
        sx.ins(x[i]); sy.ins(y[i]);
    }

    if(sx.size() == 1 or sy.size() == 1) {
        print(-1);
        return;
    }

    int prev = inf,diff = inf,Px;

    for(int i : sx) {
        if(prev == inf) prev = i;
        else if(diff == inf) diff = i - prev; 
        else if(diff != i - prev) {
            print(1);
            return;
        }
        Px = prev;
        prev = i;
    }

    x[2] = prev; x[1] = Px;  
    prev = diff = inf; int Py;

    for(int i : sy) {
        if(prev == inf) prev = i;
        else if(diff == inf) diff = i - prev; 
        else if(diff != i - prev) {
            print(1);
            return;
        }

        Py = prev;
        prev = i;
    }

    y[2] = prev; y[1] = Py;
    print(x[2] - x[1] + y[2] - y[1] - 2 + 1ll * (x[2] - x[1] - 1) * (y[2] - y[1] - 1) + 1);
}

signed main(){

    ios_base::sync_with_stdio(false); cin.tie(0);

    int tc=1;
    //cin>>tc;
    for(int t = 0; t < tc; t++) solve(t);
}

• Subtask 1: 0 / 1
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 29
• Subtask 5: 0 / 15
• Subtask 6: 0 / 35