Task: | Pussit |
Sender: | |
Submission time: | 2015-08-16 17:54:58 +0300 |
Language: | C++ |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.05 s | 1 | details |
#2 | WRONG ANSWER | 0.07 s | 2 | details |
#3 | WRONG ANSWER | 0.05 s | 3 | details |
Code
#include <bits/stdc++.h> #define ll long long #define ull unsigned long long #define pii pair<int, int> #define pll pair<long long, long long> #define defmod 1000000007 using namespace std; int main(){ cin.sync_with_stdio(0); cin.tie(0); int t; cin >> t; while(t--){ ll n, m, k; cin >> n >> m >> k; if(m < n){ ll re = n-m+k; cout << re << endl; } else{ ll su = 0; ll a = 0, b = 2000000000; unordered_set<ll> kk; while(a < b){ ll mid = (a+b)/2; if(kk.count(mid)){ break; } kk.insert(mid); ll yht = (n-1)*mid; if(m-yht < mid){ b = mid-1; } else{ a = mid; } } su = (a+b)/2; if((k-su) <= 0){ cout << k << endl; } else{ cout << k+1 << endl; } } } return 0; }
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
input |
---|
1000 11 16 2 5 16 15 2 14 14 9 11 1 ... |
correct output |
---|
2 15 14 1 1 ... |
user output |
---|
3 16 15 2 1 ... |
Test 2
Group: 2
Verdict: WRONG ANSWER
input |
---|
1000 1436 3023 1378 4419 4559 3881 115 4220 1440 3556 3152 1653 ... |
correct output |
---|
1378 3881 1440 2057 5312 ... |
user output |
---|
1379 3882 1441 2057 3642 ... |
Test 3
Group: 3
Verdict: WRONG ANSWER
input |
---|
1000 337723917 939459738 544279388 233319567 486500388 164139442 722536320 995223331 969580610 274242146 994174001 844564432 ... |
correct output |
---|
544279388 164139442 1194505265 870263078 547470112 ... |
user output |
---|
544279389 164139443 969580611 844564433 547470112 ... |