QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#880873 | #9979. Corrupted Scoreboard Log | yuanruiqi | WA | 312ms | 3840kb | C++26 | 2.0kb | 2025-02-03 22:14:48 | 2025-02-03 22:14:49 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
struct node
{
int o, p, c;
string s;
};
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int t, n;
cin >> t >> n;
while (t--)
{
string s;
cin >> s;
for (int l=2;l<=s.size()&&isdigit(s[l-1]);++l)
{
string t = s.substr(l), e = s.substr(0, l);
vector<string> v;
while (t.size())
for (int i=0;i<t.size();++i)
if (t[i] == 's' || t[i] == 'y')
{
v.emplace_back(t.substr(0, i + 1));
t.erase(t.begin(), t.begin() + i + 1);
break;
}
int m = v.size(), ok = 0;
vector<array<node, 2> > u(m);
for (int i=0;i<m;++i)
for (int j=0;j<2;++j)
{
int &o = u[i][j].o, &p = u[i][j].p, &c = u[i][j].c;
o = 1; p = c = 0;
string &f = u[i][j].s;
int x, y;
if (j) x = 2, y = 5;
else if (v[i].back() == 'y') x = 1, y = 3;
else if (v[i].size() >= 8 && v[i].substr(v[i].size() - 8, 3) == "100") x = 3, y = 5;
else x = 1, y = 5;
if (x + y > v[i].size()) o = 0;
else
{
string a = v[i].substr(0, v[i].size() - x - y), b = v[i].substr(v[i].size() - x - y, x), d = v[i].substr(v[i].size() - y);
if (a.size() > 1 && a[0] == '0' || b.size() && b[0] == '0') o = 0;
else if (x + y == v[i].size()) f = b + " " + d + " ";
else ++c, p += stoi(a) + 20 * (stoi(b) - 1), f = a + " " + b + " " + d + " ";;
}
}
for (int s=0;s<(1<<m);++s)
{
int o = 1;
int p = 0, c = 0;
string f;
for (int i=0;i<m&&o;++i)
{
auto &d = u[i][s >> i & 1];
o &= d.o;
p += d.p;
c += d.c;
}
if (o && e == to_string(c) + to_string(p))
{
for (int i=0;i<m&&o;++i) f += u[i][s >> i & 1].s;
while (f.size() && f.back() == ' ') f.pop_back();
ok = 1;
if (f.size()) cout << c << ' ' << p << ' ' << f << '\n';
else cout << c << ' ' << p << '\n';
break;
}
}
if (ok) break;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3840kb
input:
4 12 99351583tries261try312tries231try4tries431try2412tries551try991try1791try 912121482tries572tries392tries821try4tries431try521try2492tries1842tries2183tries 912181082tries141try542tries922tries6tries302tries6tries502tries2441try1956tries1714tries 913221241try261try542tries1331try2002tries621try2...
output:
9 935 158 3 tries 26 1 try 31 2 tries 23 1 try 4 tries 43 1 try 241 2 tries 55 1 try 99 1 try 179 1 try 9 1212 148 2 tries 57 2 tries 39 2 tries 82 1 try 4 tries 43 1 try 52 1 try 249 2 tries 184 2 tries 218 3 tries 9 1218 108 2 tries 14 1 try 54 2 tries 92 2 tries 6 tries 30 2 tries 6 tries 50 2 tr...
result:
ok 4 lines (4 test cases)
Test #2:
score: 0
Accepted
time: 0ms
memory: 3712kb
input:
5 2 0022tries22tries 12222tries22tries 24422tries22tries 284222tries222tries 2844222tries222tries
output:
0 0 22 tries 22 tries 1 22 22 tries 2 2 tries 2 44 2 2 tries 2 2 tries 2 84 22 2 tries 22 2 tries 2 844 2 22 tries 2 22 tries
result:
ok 5 lines (5 test cases)
Test #3:
score: 0
Accepted
time: 33ms
memory: 3712kb
input:
500 13 91481641try2951try511try1try1291try2781try1331try651try1961try1try2701try 001try1try1try1try1try 131200151try201try151try151try361try881try1231try1761try1921try1901try341try2061try901try 1325842381try131try1621try2961try2261try1891try1091try1701try971try2961try2761try2651try2471try 916741021t...
output:
9 1481 64 1 try 295 1 try 51 1 try 1 try 129 1 try 278 1 try 133 1 try 65 1 try 196 1 try 1 try 270 1 try 0 0 1 try 1 try 1 try 1 try 1 try 13 1200 15 1 try 20 1 try 15 1 try 15 1 try 36 1 try 88 1 try 123 1 try 176 1 try 192 1 try 190 1 try 34 1 try 206 1 try 90 1 try 13 2584 238 1 try 13 1 try 162...
result:
ok 500 lines (500 test cases)
Test #4:
score: 0
Accepted
time: 74ms
memory: 3712kb
input:
500 13 133396204tries9210tries2749tries165tries2009tries4810tries8110tries2128tries1069tries1986tries552tries2009tries1947tries 716809tries2666tries10tries1try1393tries9tries4tries25210tries701try1767tries304tries879tries10tries 614008tries739tries6tries1969tries1757tries1306tries2tries3tries3tries9...
output:
13 3396 20 4 tries 92 10 tries 274 9 tries 16 5 tries 200 9 tries 48 10 tries 81 10 tries 212 8 tries 106 9 tries 198 6 tries 55 2 tries 200 9 tries 194 7 tries 7 1680 9 tries 266 6 tries 10 tries 1 try 139 3 tries 9 tries 4 tries 252 10 tries 70 1 try 176 7 tries 30 4 tries 87 9 tries 10 tries 6 14...
result:
ok 500 lines (500 test cases)
Test #5:
score: -100
Wrong Answer
time: 312ms
memory: 3712kb
input:
500 13 9915918023tries20tries9218tries17987tries54tries94tries20855tries53tries26867tries4671tries2207tries7015tries17652tries 111178523199tries2tries2093tries6565tries401try20894tries28582tries35tries2744tries16413tries29254tries528tries8582tries 1103862tries7tries19tries96tries12tries73tries24trie...
output:
9 9159 180 23 tries 20 tries 92 18 tries 179 87 tries 54 tries 94 tries 208 55 tries 53 tries 268 67 tries 46 71 tries 220 7 tries 70 15 tries 176 52 tries 11 11785 231 99 tries 2 tries 209 3 tries 65 65 tries 40 1 try 208 94 tries 285 82 tries 35 tries 274 4 tries 164 13 tries 292 54 tries 52 8 tri...
result:
wrong answer 895 min in a problem is invalid (test case 9)