oj.uz

Submission #998217

# Submission time Handle Problem Language Result Execution time Memory
998217 2024-06-13T12:01:57 Z yeediot Portal (BOI24_portal) C++17
21 / 100
 22 ms 6688 KB 
#include<bits/stdc++.h>
using namespace std;
#define int __int128
#define ll long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
#ifdef local
void CHECK();
void setio(){
    freopen("/Users/iantsai/cpp/input.txt","r",stdin);
    freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const ll mxn = 1e5+5;
ll _n, _a, _b;
int n, dx[mxn], dy[mxn];
vector<pii>vec, p;
void exgcd(int a, int b){
    if(vec[a].F ==0 or vec[b].F == 0)return;
    if(vec[a].F < 0){
        vec[a].F *= -1;
        vec[a].S *= -1;
    }
    if(vec[b].F < 0){
        vec[b].F *= -1;
        vec[b].S *= -1;
    }
    if(vec[a].F < vec[b].F) swap(a, b);       
    int q=vec[a].F/vec[b].F;
    vec[a].F -= q*vec[b].F;
    exgcd(a, b);
}
void cal(){
    for(int i=0;i<2;i++){
        if(vec[0].F < 0){
            vec[0].F *= -1;
            vec[0].S *= -1;
        }
        if(vec[1].F < 0){
            vec[1].F *= -1;
            vec[1].S *= -1;
        }
        if(vec[0].F < vec[1].F) swap(vec[0], vec[1]);
        exgcd(0, 1);
        if(vec[0].F == 0)swap(vec[0], vec[2]);
        else swap(vec[1], vec[2]);
    }
    vector<pii>temp;
    int g = 0;
    for(int i=0;i<3;i++){
        if(vec[i].F) temp.pb(vec[i]);
        else g = __gcd(g, vec[i].S);
    }
    temp.pb({0,g});
    vec = temp;
}
signed main(){
    TOI_is_so_de;
    cin >> _n;
    n = _n;
    p.resize(n);
    for(int i=0;i<n;i++){
        cin >> _a >> _b;
        p[i] = {_a, _b};
    }
    //random_shuffle(all(p));
    //sort(p+1, p+1+n, [&](pii i, pii j){return rng()&1 ? 1 : 0;});
    for(int i=1;i<n;i++){
        dx[i] = p[i].F-p[i-1].F;
        dy[i] = p[i].S-p[i-1].S;
    }
    for(int i=1;i<n;i++){
        vec.pb({dx[i], dy[i]});
        if(sz(vec)>=3)cal();
    }
    if(sz(vec)<=1){
        cout << -1 << '\n';
    }
    else{
        if(vec[0].F*vec[1].S-vec[1].F*vec[0].S){
            ll ans = vec[0].F*vec[1].S-vec[1].F*vec[0].S;
            if(ans < 0) ans *= -1;
            cout << ans << '\n';
        }
        else{
            cout << -1 << '\n';
        }
    }
    #ifdef local
    CHECK();
    #endif
}
/*
input:
 
*/
#ifdef local
void CHECK(){
    cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
     function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
         std::ifstream file1(p1);
         std::ifstream file2(p2);
         if (!file1.is_open() || !file2.is_open())return false;
         std::string line1, line2;
         while (getline(file1, line1) && getline(file2, line2)) {
             if (line1 != line2)return false;
         }
         int cnta=0,cntb=0;
         while(getline(file1,line1))cnta++;
         while(getline(file2,line2))cntb++;
         return cntb-cnta<=1;
     };
     bool check = compareFiles("output.txt","expected.txt");
     if (check) cerr<<"ACCEPTED\n";
     else cerr<<"WRONG ANSWER!\n";
}
#else
#endif

Compilation message

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:20:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:21:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 0 ms 2396 KB Output is correct
28 Correct 0 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
33 Correct 0 ms 2396 KB Output is correct
34 Correct 0 ms 2396 KB Output is correct
35 Correct 0 ms 2392 KB Output is correct
36 Correct 0 ms 2396 KB Output is correct
37 Correct 0 ms 2396 KB Output is correct
38 Correct 0 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 21 ms 6488 KB Output is correct
3 Correct 21 ms 6488 KB Output is correct
4 Correct 22 ms 6492 KB Output is correct
5 Correct 21 ms 6680 KB Output is correct
6 Correct 21 ms 6492 KB Output is correct
7 Correct 21 ms 6488 KB Output is correct
8 Correct 20 ms 6492 KB Output is correct
9 Correct 19 ms 6492 KB Output is correct
10 Correct 21 ms 6492 KB Output is correct
11 Correct 21 ms 6688 KB Output is correct
12 Correct 22 ms 6684 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 22 ms 6492 KB Output is correct
15 Correct 22 ms 6680 KB Output is correct
16 Correct 21 ms 6492 KB Output is correct
17 Correct 22 ms 6684 KB Output is correct
18 Correct 22 ms 6492 KB Output is correct
19 Correct 22 ms 6492 KB Output is correct
20 Correct 21 ms 6688 KB Output is correct

Subtask #4
0 / 29.0

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

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 0 ms 2396 KB Output is correct
28 Correct 0 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
33 Correct 0 ms 2396 KB Output is correct
34 Correct 0 ms 2396 KB Output is correct
35 Correct 0 ms 2392 KB Output is correct
36 Correct 0 ms 2396 KB Output is correct
37 Correct 0 ms 2396 KB Output is correct
38 Correct 0 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 0 ms 2396 KB Output is correct
41 Correct 0 ms 2396 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Incorrect 0 ms 2396 KB Output isn't correct
45 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 0 ms 2396 KB Output is correct
28 Correct 0 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
33 Correct 0 ms 2396 KB Output is correct
34 Correct 0 ms 2396 KB Output is correct
35 Correct 0 ms 2392 KB Output is correct
36 Correct 0 ms 2396 KB Output is correct
37 Correct 0 ms 2396 KB Output is correct
38 Correct 0 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 21 ms 6488 KB Output is correct
42 Correct 21 ms 6488 KB Output is correct
43 Correct 22 ms 6492 KB Output is correct
44 Correct 21 ms 6680 KB Output is correct
45 Correct 21 ms 6492 KB Output is correct
46 Correct 21 ms 6488 KB Output is correct
47 Correct 20 ms 6492 KB Output is correct
48 Correct 19 ms 6492 KB Output is correct
49 Correct 21 ms 6492 KB Output is correct
50 Correct 21 ms 6688 KB Output is correct
51 Correct 22 ms 6684 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 22 ms 6492 KB Output is correct
54 Correct 22 ms 6680 KB Output is correct
55 Correct 21 ms 6492 KB Output is correct
56 Correct 22 ms 6684 KB Output is correct
57 Correct 22 ms 6492 KB Output is correct
58 Correct 22 ms 6492 KB Output is correct
59 Correct 21 ms 6688 KB Output is correct
60 Correct 0 ms 2396 KB Output is correct
61 Correct 0 ms 2396 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 1 ms 2396 KB Output is correct
64 Incorrect 0 ms 2396 KB Output isn't correct
65 Halted 0 ms 0 KB -