Submission #1267923

#TimeUsernameProblemLanguageResultExecution timeMemory
1267923gry3125Portal (BOI24_portal)C++20
0 / 100
48 ms1092 KiB
#include <bits/stdc++.h>
#define pb push_back
#define ll long long int
#define all(v) (v).begin(),(v).end()
#define fi first 
#define se second
using namespace std;

int main() {
    int n; cin >> n;
    vector<pair<int,int>> p;
    p.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> p[i].fi >> p[i].se;
    }
    if (n == 1 || p[0].fi == p[1].fi || p[0].se == p[1].se) {
        cout << -1;
    } else {
        cout << (p[0].fi-p[1].fi)*(p[0].se-p[1].se);
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...