/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 540.0 KiB
#2 Accepted 131ms 604.0 KiB
#3 Accepted 125ms 616.0 KiB
#4 Accepted 157ms 604.0 KiB
#5 Accepted 154ms 616.0 KiB
#6 Accepted 8ms 580.0 KiB
#7 Accepted 8ms 564.0 KiB
#8 Accepted 6ms 568.0 KiB
#9 Time Exceeded ≥1071ms ≥568.0 KiB
#10 Time Exceeded ≥1049ms ≥560.0 KiB

Code

#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

void solve() {
    ll n, m, k, c = 0, ans = 0;
    string s1, s2;
    // cin >> n;
    n = 3;
    vector<ll> v(n);
    for (int i = 0; i < n; i++) {
        ll x; cin >> x;
        v[i] = x;
    }
    sort(all(v));
    ll d1 = v[1] - v[0];
    ll d2 = v[2] - v[1];
    ll gcd = __gcd(d1, d2);
    while(v[0] != v[1]) v[0] += gcd, ++ans;
    while(v[1] != v[2]) v[2] -= gcd, ++ans;
    cout << ans << endl;
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1061 Bring equality
Contest
Brain Booster #4
Language
C++20 (G++ 13.2.0)
Submit At
2024-07-14 15:37:32
Judged At
2024-10-03 13:39:31
Judged By
Score
80
Total Time
≥1071ms
Peak Memory
≥616.0 KiB