QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#880875#9979. Corrupted Scoreboard LogyuanruiqiWA 146ms3712kbC++262.0kb2025-02-03 22:16:052025-02-03 22:16:05

Judging History

This is the latest submission verdict.

  • [2025-02-03 22:16:05]
  • Judged
  • Verdict: WA
  • Time: 146ms
  • Memory: 3712kb
  • [2025-02-03 22:16:05]
  • Submitted

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' || a.size() && stoi(a) >= 300) 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: 1ms
memory: 3712kb

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: 1ms
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: 22ms
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: 40ms
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: 0
Accepted
time: 79ms
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:

ok 500 lines (500 test cases)

Test #6:

score: 0
Accepted
time: 1ms
memory: 3712kb

input:

500 1
1150018067tries
116832384tries
1107329340tries
0044tries
0082tries
166116126tries
0093tries
0022tries
1175413482tries
0072tries
195717740tries
0065tries
0083tries
0016tries
0067tries
0087tries
0011tries
110525251tries
00100tries
001try
005tries
0020tries
1149113169tries
0034tries
0019tries
009...

output:

1 1500 180 67 tries
1 1683 23 84 tries
1 1073 293 40 tries
0 0 44 tries
0 0 82 tries
1 661 161 26 tries
0 0 93 tries
0 0 22 tries
1 1754 134 82 tries
0 0 72 tries
1 957 177 40 tries
0 0 65 tries
0 0 83 tries
0 0 16 tries
0 0 67 tries
0 0 87 tries
0 0 11 tries
1 1052 52 51 tries
0 0 100 tries
0 0 1 t...

result:

ok 500 lines (500 test cases)

Test #7:

score: 0
Accepted
time: 1ms
memory: 3712kb

input:

500 1
00
11211211try
001try
00
120201try
00
00
12842841try
12872871try
001try
001try
146461try
12832831try
11381381try
142421try
00
001try
12542541try
135351try
11961961try
12092091try
12592591try
12572571try
00
12862861try
11671671try
11141141try
12932931try
001try
131311try
12962961try
11481481try...

output:

0 0
1 121 121 1 try
0 0 1 try
0 0
1 20 20 1 try
0 0
0 0
1 284 284 1 try
1 287 287 1 try
0 0 1 try
0 0 1 try
1 46 46 1 try
1 283 283 1 try
1 138 138 1 try
1 42 42 1 try
0 0
0 0 1 try
1 254 254 1 try
1 35 35 1 try
1 196 196 1 try
1 209 209 1 try
1 259 259 1 try
1 257 257 1 try
0 0
1 286 286 1 try
1 16...

result:

ok 500 lines (500 test cases)

Test #8:

score: 0
Accepted
time: 138ms
memory: 3712kb

input:

500 13
1371942032tries2588tries2053tries859tries2688tries2778tries2252tries78tries287tries1272tries329tries1784tries1823tries
1372752366tries2336tries2118tries972tries294tries157tries1595tries2012tries2443tries2855tries2917tries444tries2587tries
13119831738tries1863tries277tries748tries1056tries2788...

output:

13 7194 203 2 tries 258 8 tries 20 53 tries 8 59 tries 268 8 tries 277 8 tries 225 2 tries 7 8 tries 2 87 tries 127 2 tries 3 29 tries 178 4 tries 18 23 tries
13 7275 23 66 tries 23 36 tries 211 8 tries 97 2 tries 2 94 tries 15 7 tries 159 5 tries 20 12 tries 244 3 tries 28 55 tries 291 7 tries 44 4...

result:

ok 500 lines (500 test cases)

Test #9:

score: 0
Accepted
time: 138ms
memory: 3584kb

input:

500 13
13102131275tries2282tries1497tries1632tries369tries2542tries2656tries1338tries332tries1082tries1214tries1586tries2873tries
1385282547tries993tries1658tries1826tries2792tries267tries2685tries2519tries255tries947tries496tries445tries328tries
1373111432tries1312tries2587tries2768tries832tries183...

output:

13 10213 12 75 tries 22 82 tries 149 7 tries 163 2 tries 3 69 tries 25 42 tries 26 56 tries 13 38 tries 33 2 tries 10 82 tries 12 14 tries 158 6 tries 287 3 tries
13 8528 25 47 tries 99 3 tries 16 58 tries 18 26 tries 279 2 tries 26 7 tries 26 85 tries 25 19 tries 25 5 tries 9 47 tries 4 96 tries 44...

result:

ok 500 lines (500 test cases)

Test #10:

score: 0
Accepted
time: 146ms
memory: 3712kb

input:

500 13
13101112157tries897tries2799tries965tries2182tries432tries2845tries1286tries2128tries1953tries2078tries327tries2869tries
124080377tries2158tries1432tries138tries1364tries1084tries2145tries1162tries556tries1745tries1854tries1514tries39tries
13117182394tries1796tries2754tries446tries1453tries21...

output:

13 10111 215 7 tries 89 7 tries 279 9 tries 9 65 tries 21 82 tries 4 32 tries 28 45 tries 12 86 tries 21 28 tries 195 3 tries 20 78 tries 32 7 tries 286 9 tries
12 4080 37 7 tries 215 8 tries 143 2 tries 13 8 tries 136 4 tries 108 4 tries 214 5 tries 116 2 tries 5 56 tries 17 45 tries 185 4 tries 15...

result:

ok 500 lines (500 test cases)

Test #11:

score: -100
Wrong Answer
time: 0ms
memory: 3712kb

input:

6 2
23421111try1112tries
23421111tries1112tries
23421112tries1111try
23421112tries1111tries
23221110tries1112tries
23221112tries1110tries

output:

2 342 111 1 try 11 12 tries
2 342 11 11 tries 111 2 tries
2 342 11 12 tries 111 1 try
2 342 11 12 tries 111 1 tries
2 322 11 10 tries 111 2 tries
2 322 111 2 tries 11 10 tries

result:

wrong answer 1 can't be matched with tries (test case 4)