QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#879787#9979. Corrupted Scoreboard LogyuanruiqiWA 2157ms3712kbC++261.6kb2025-02-02 14:07:152025-02-02 14:07:17

Judging History

This is the latest submission verdict.

  • [2025-02-02 14:07:17]
  • Judged
  • Verdict: WA
  • Time: 2157ms
  • Memory: 3712kb
  • [2025-02-02 14:07:15]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
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;
			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)
				{
					int x, y;
					if (s >> i & 1) 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; break;}
					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() && a[0] == '0' || b.size() && b[0] == '0') {o = 0; break;}
					if (x + y == v[i].size()) { f += b + " " + d + " "; continue;}
					++c;
					p += stoi(a) + 20 * (stoi(b) - 1);
					f += a + " " + b + " " + d + " ";
				}
				if (o && e == to_string(c) + to_string(p))
				{
					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: 8ms
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: 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: -100
Wrong Answer
time: 2157ms
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:

wrong answer It is not same after removing spaces (test case 75)