QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #872855 | #8619. Interactive Casino | ucup-team3695# | WA | 2ms | 3456kb | C++20 | 464b | 2025-01-26 05:58:26 | 2025-01-26 05:58:31 |
Judging History
answer
#include <bits/extc++.h>
using namespace std;
using namespace chrono;
namespace rg = ranges;
namespace vw = views;
int main()
{
cin.tie(0)->sync_with_stdio();
int T;
cin >> T;
int G = T == 5 ? 1000 : 10000;
int m, b;
string str;
for (int i = 0; i < T; i++)
{
cin >> str;
if (str != "ROUND")
return 0;
cin >> m >> b;
if (m >= G || b < 20)
cout << "SKIP\n";
else
cout << "PLAY\n";
cout << flush;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3456kb
input:
5 ROUND 1000 43 ROUND 1000 546 ROUND 1000 809 ROUND 1000 759 ROUND 1000 889 WIN
output:
SKIP SKIP SKIP SKIP SKIP
result:
ok OK
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3456kb
input:
1000 ROUND 1000 741 ROUND 259 171 ROUND 88 7 ROUND 88 43 ROUND 45 43 ROUND 2 1 ROUND 2 1 ROUND 2 2 ROUND 2 1 ROUND 2 2 ROUND 2 1 ROUND 2 1 ROUND 2 2 ROUND 2 1 ROUND 2 1 ROUND 2 2 ROUND 2 2 ROUND 2 1 ROUND 2 1 ROUND 2 2 ROUND 2 2 ROUND 2 2 ROUND 2 2 ROUND 2 2 ROUND 2 1 ROUND 2 1 ROUND 2 2 ROUND 2 1 R...
output:
PLAY PLAY SKIP PLAY PLAY SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP SKIP ...
result:
wrong answer WA