/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 0ms 560.0 KiB
#2 Accepted 69ms 1.215 MiB
#3 Accepted 41ms 1.582 MiB
#4 Accepted 48ms 2.52 MiB

Code

#include <stdio.h>

int main() {
    int t;
    scanf("%d", &t);
    while(t--) {
        long long l, r, x;
        scanf("%lld %lld %lld", &l, &r, &x);
        if(x == 0) {
            if(l <= r)
                printf("%lld %lld\n", l, l);
            else
                printf("-1 -1\n");
        } else {
            if(l + x >= l && l + x <= r) {
                printf("%lld %lld\n", l + x, l);
            }
            else if(r + x >= l && r + x <= r) {
                printf("%lld %lld\n", r + x, r);
            }
            else if(r - x >= l && r - x <= r) {
                printf("%lld %lld\n", r, r - x);
            }
            else if(l - x >= l && l - x <= r) {
                printf("%lld %lld\n", l, l - x);
            }
            else {
                printf("-1 -1\n");
            }
        }
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1186 Equal to X
Contest
Brain Booster #9
Language
C99 (GCC 13.2.0)
Submit At
2025-04-06 17:22:17
Judged At
2025-04-06 17:22:17
Judged By
Score
100
Total Time
69ms
Peak Memory
2.52 MiB