Submission #998245

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
998245	2024-06-13T12:29:47 Z	yeediot	Portal (BOI24_portal)	C++17	1 / 100	20 ms	3444 KB

Main

#include<bits/stdc++.h>
using namespace std;
#define int 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 __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
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();
int cross(pii a, pii b){
    return a.S*b.F-a.F*b.S;
}
tuple<int,int,int>exgcd(int a, int b){
    if(b == 0)return {a, 1, 0};
    auto [g, s, t] = exgcd(b, a%b);
    return {g, t, s-a/b*t};
}
signed main(){
    TOI_is_so_de;
    int n;
    cin >> n;
    vector<pii>p(n+1);
    int d[2][n];
    memset(d, 0 ,sizeof(d));
    for(int i=0;i<n;i++){
        cin >> p[i].F >> p[i].S;
    }
    for(int i=0;i+1<n;i++){
        d[0][i] = p[i+1].F-p[i].F;
        d[1][i] = p[i+1].S-p[i].S;
    }
    for(int i=0;i+1<n;i++){
        if(d[0][i]){
            swap(d[0][i], d[0][0]);
            swap(d[1][i], d[1][0]);
            break;
        }
    }
    if(d[0][0] == 0){
        cout << -1 << '\n';
        return 0;
    }
    int ans = 0;
    for(int i=1;i+1<n;i++){
        auto [g, s, t] = exgcd(d[0][0], d[0][i]);
        if(s == 0){
            swap(s, t);
            swap(d[0][0], d[0][i]);
            swap(d[1][0], d[1][i]);
        }
        int f = d[0][0]*s+d[0][i]*t;
        int f2 = d[1][0]*s+d[1][i]*t;
        d[0][0] = f;
        if(ans)d[1][0] = f2%ans;
        else d[1][0] = f2;
        s = d[1][i] - d[0][i]/g*d[1][0];
        ans = gcd(ans, s);
    }
    ans = abs(ans*d[0][0]);
    cout << (ans == 0 ? -1 : ans) << '\n';
    #ifdef local
    CHECK();
    #endif
}
/*
input:
 2 -1
 0  2
*/
#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:35:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.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	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	348 KB	Output is correct
17	Correct	348 KB	Output is correct
18	Correct	348 KB	Output is correct

Subtask #2
0 / 10.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	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	348 KB	Output is correct
17	Correct	348 KB	Output is correct
18	Correct	348 KB	Output is correct
19	Correct	348 KB	Output is correct
20	Incorrect	348 KB	Output isn't correct
21	Halted	0 KB	-

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	16 ms	3420 KB	Output is correct
3	Correct	14 ms	3420 KB	Output is correct
4	Correct	15 ms	3420 KB	Output is correct
5	Correct	15 ms	3416 KB	Output is correct
6	Correct	15 ms	3420 KB	Output is correct
7	Correct	14 ms	3420 KB	Output is correct
8	Correct	14 ms	3444 KB	Output is correct
9	Correct	13 ms	3420 KB	Output is correct
10	Correct	13 ms	3420 KB	Output is correct
11	Correct	14 ms	3420 KB	Output is correct
12	Correct	17 ms	3420 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	15 ms	3420 KB	Output is correct
15	Incorrect	20 ms	3420 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	344 KB	Output is correct
5	Correct	0 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	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 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	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Incorrect	0 ms	348 KB	Output isn't correct
40	Halted	0 ms	0 KB	-

Subtask #5
0 / 15.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	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	348 KB	Output is correct
17	Correct	348 KB	Output is correct
18	Correct	348 KB	Output is correct
19	Correct	348 KB	Output is correct
20	Incorrect	348 KB	Output isn't correct
21	Halted	0 KB	-

Subtask #6
0 / 35.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	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	348 KB	Output is correct
17	Correct	348 KB	Output is correct
18	Correct	348 KB	Output is correct
19	Correct	348 KB	Output is correct
20	Incorrect	348 KB	Output isn't correct
21	Halted	0 KB	-

Submission #998245

Compilation message

Subtask #1 1.0 / 1.0

Subtask #2 0 / 10.0

Subtask #3 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
0 / 10.0

Subtask #4
0 / 29.0

Subtask #5
0 / 15.0

Subtask #6
0 / 35.0