/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Wrong Answer 1ms 768.0 KiB
#3 Wrong Answer 2ms 812.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define vv vector<long long>
#define dq deque<long long>
#define mpp map<long long,long long>
#define ms multiset<long long>
#define ss set<long long>
#define vpp vector<pair<long long, long long>>
#define MOD 1000000007
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define all(a) a.begin(),a.end()
#define sort_rev(a) sort(a.rbegin(),a.rend())
#define all_n for(int i=0;i<n;i++)
#define print(a) for(auto it:a)cout<<it<<" "
#define print_pair(a) for(auto it:a)cout<<it.first<<" "<<it.second<<endl
#define scan(a,n) for(int i=0;i<n;i++)cin>>a[i]
void requisite(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
}
void solve(){
    ll a,b,x;cin>>a>>b>>x;
    if (x>=a){
        x-=a;
        a=0;
        b-=x;
    }
    else{
        a=x;
    }
    cout<<a<<" "<<b<<endl;
}
int main() {
    requisite();
    ll t=1;
    cin>>t;
    while (t--){
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1187 Ticket Battle: Hridoy vs Kamona
Language
C++17 (G++ 13.2.0)
Submit At
2025-04-08 04:49:08
Judged At
2025-04-08 04:49:08
Judged By
Score
10
Total Time
2ms
Peak Memory
812.0 KiB