/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 320.0 KiB
#3 Accepted 2ms 320.0 KiB
#4 Accepted 5ms 532.0 KiB
#5 Accepted 52ms 1.312 MiB
#6 Accepted 39ms 1.258 MiB
#7 Accepted 37ms 1.152 MiB
#8 Accepted 37ms 1.27 MiB
#9 Accepted 2ms 532.0 KiB
#10 Accepted 64ms 1.348 MiB

Code

using i64 = long long;
using i128 = __int128;
using u32 = unsigned;
using u64 = unsigned long long;
using f32 = double;
using f64 = long double;

#define uset unordered_set
#define umap unordered_map
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<i64>
#define vvll vector<vll>
#define pii pair<int, int>
#define pll pair<i64, i64>
#define vpii vector<pii>
#define vpll vector<pll>
#define vvpii vector<vpii>
#define vvpll vector<vpll>
#define vz vector<Z>
#define vvz vector<vz>
#define pb push_back
#define pq priority_queue
#define ALL(x) (x).begin(), (x).end()
#define rep(i, x, y) for (int (i) = (x); (i) < (y); (i)++)
#define repr(i, x, y) for (int (i) = (x); (i) > (y); (i)--)
#define YES "YES\n"
#define NO "NO\n"
#define SZ(x) (static_cast<int>(x.size()))


#include <bits/stdc++.h>

using namespace std;

mt19937_64 rng((unsigned) chrono::high_resolution_clock::now().time_since_epoch().count());

void solve() {
    int a, b, x;
    cin >> a >> b >> x;
    if (x >= a) {
        x -= a;
        a = 0;
        b = max(0, b - x);
        cout << a << " " << b << "\n";
    } else cout << a - x << " " << b << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t;
    while (t--) solve();
}

Information

Submit By
Type
Submission
Problem
P1187 Ticket Battle: Hridoy vs Kamona
Contest
Brain Booster #9
Language
C++17 (G++ 13.2.0)
Submit At
2025-04-06 15:31:55
Judged At
2025-04-06 15:31:55
Judged By
Score
100
Total Time
64ms
Peak Memory
1.348 MiB