QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #870517 | #8619. Interactive Casino | ucup-team4893# | WA | 8ms | 27336kb | C++17 | 832b | 2025-01-25 16:40:02 | 2025-01-25 16:40:03 |
Judging History
answer
#include<iostream>
#include<cstdio>
#include<fstream>
#include<queue>
#include<algorithm>
#define fopen(x, y) freopen(x".in", "r", stdin); freopen(y".out", "w", stdout);
//#define int long long
#ifdef int
#define inf 0x3f3f3f3f3f3f3f3fll
#else
#define inf 0x3f3f3f3f
#endif
using namespace std;
int n, dis[1005], _dis[1005];
vector<int> g[1005][1005];
int ask(int i, int j) {
if(i == j) return 0;
cout << i << ' ' << j << '\n';
fflush(stdout);
int d; cin >> d;
if(d == 0) exit(0);
return d;
}
double x;
signed main() {
cin >> n;
int c = (n == 5 ? 2 : 20);
for(int i = 1; i <= n; i++) {
string s;
int l, r;
cin >> s >> l >> r;
if(((l + r) / 2) <= n / c) {
cout << "PLAY\n";
if(c == 10) n += (l + r) / 4.5;
}
else cout << "SKIP\n";
fflush(stdout);
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 27316kb
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: 8ms
memory: 27336kb
input:
1000 ROUND 1000 741 ROUND 1000 70 ROUND 1000 211 ROUND 1000 996 ROUND 1000 215 ROUND 1000 827 ROUND 1000 472 ROUND 1000 738 ROUND 1000 938 ROUND 1000 53 ROUND 1000 565 ROUND 1000 880 ROUND 1000 389 ROUND 1000 242 ROUND 1000 459 ROUND 1000 653 ROUND 1000 164 ROUND 1000 91 ROUND 1000 937 ROUND 1000 85...
output:
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 SKIP SKIP SKIP SKIP SKIP ...
result:
wrong answer WA