QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#519639 | #4682. Pipe Stream | PetroTarnavskyi | WA | 0ms | 3728kb | C++23 | 1.1kb | 2024-08-14 22:27:02 | 2024-08-14 22:27:02 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;
void solve()
{
int l, v1, v2, t, s;
cin >> l >> v1 >> v2 >> t >> s;
l /= s;
int cnt = 0;
int inter = 1;
while(v2 - v1 > t * inter)
{
if(cnt > 100)
{
cout << l << "," << v1 << "," << v2 << "," << t << "," << s << "\n";
cout << "impossible\n";
return;
}
int v = l / (cnt + 1);
if(v + t < v2)
{
int nprom = (v2 - v - 1) / t;
if(inter < nprom)
{
cout << "impossible\n";
return;
}
v2 -= t * nprom;
inter = 2 * (inter - nprom);
}
else
inter = 2 * inter;
cnt++;
}
cout << cnt << "\n";
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while(t--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3700kb
input:
3 1000 1 30 1 1 60 2 10 2 5 59 2 10 2 5
output:
5 3 impossible
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
100 1 1 2 1 1 1 1 3 1 1 2 1 3 1 1 3 1 4 1 1 4 1 4 1 1 100000 1 1000000 1 1 100000 1 9 1 1 100000 1 9454 1 1 100000 1 9455 1 1 500832 1 40181 1 1 500832 1 40182 1 1 524288 1 41871 1 1 524288 1 41872 1 1 930168 1 70677 1 1 930168 1 70678 1 1 930169 1 70677 1 1 930169 1 70678 1 1 930170 1 70677 1 1 930...
output:
0 impossible 1 impossible 2 impossible 3 24 impossible 45 impossible 32 impossible 46 impossible 46 impossible 46 impossible 45 impossible 45 impossible impossible 3 3 4 impossible 0 0 impossible 17 15 16 2 2 15 15 14 1 1 0 0 impossible 16 impossible 0 1 2 2 28 29 impossible 29 impossible 0 1 imposs...
result:
ok 100 lines
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3728kb
input:
40 1000 1 30 1 1 60 2 10 2 5 59 2 10 2 5 1000000 1 80235 2 1 1000000 1 80236 2 1 1000000 1 80237 2 1 1000000 1 80238 2 1 1000000 1 80239 2 1 1000000 1 80240 2 1 1000000 1 80241 2 1 1000000 1 80242 2 1 1000000 1 80243 2 1 1000000 1 75361 1 1 1000000 1 75362 1 1 1000000 1 75363 1 1 1000000 1 75364 1 1...
output:
5 3 impossible 25 25 25 26 26 26 27 29 impossible 26 26 26 27 27 28 29 impossible impossible 28 500000,1,500002,499998,2 impossible 2 1 1,1,500000,500000,1000000 impossible 0 0 25 impossible 25 24 24 23 23 22 20 20 impossible impossible
result:
wrong answer 23rd lines differ - expected: 'impossible', found: '500000,1,500002,499998,2'