/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 32ms 1.391 MiB
#3 Accepted 42ms 1.598 MiB
#4 Accepted 44ms 2.27 MiB

Code

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pld;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpll;
typedef vector<pld> vpld;
 
#define int ll
#define all(it) it.begin(),it.end()
#define ord_set(T) tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update> 


void work(){
    int l,r,x;
    cin >> l >> r >> x;
    if (l + abs(x) > r) cout << "-1 -1\n";
    else if (x > 0) cout << l+x << ' ' << l << '\n';
    else cout << r+x << ' ' << r << '\n'; 
}


int32_t main(){
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);

    int n;
    cin >> n;
    while (n--) work();
    
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1186 Equal to X
Language
C++17 (G++ 13.2.0)
Submit At
2025-04-06 22:22:20
Judged At
2025-04-06 22:22:20
Judged By
Score
100
Total Time
44ms
Peak Memory
2.27 MiB