QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#59722#1371. Missing Numberabdelrahman001#WA 2ms3616kbC++20869b2022-10-31 22:12:312022-10-31 22:12:34

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-10-31 22:12:34]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3616kb
  • [2022-10-31 22:12:31]
  • 提交

answer

#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 1e5 + 5;
int n;
string s;
bool done[N];
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> s;
    for(int i = 1;i <= n;i++) {
		string cur = to_string(i);
		int sz = cur.size();
		bool found = false;
		for(int j = 0;j + sz <= s.size();j++) {
			bool ok = true;
			for(int k = j;k < j + sz;k++)
				ok &= (!done[k]);
			if(!ok)
				continue;
			string tmp = s.substr(j, sz);
			if(tmp == cur) {
				for(int k = j;k < j + sz;k++)
					done[k] = true;
				found = true;
				break;
			}
		}
		if(!found)
			return cout << i, 0;
	}
    return 0;
}


Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 3560kb

input:

2
1

output:

2

result:

ok single line: '2'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3572kb

input:

2
2

output:

1

result:

ok single line: '1'

Test #3:

score: -100
Wrong Answer
time: 2ms
memory: 3616kb

input:

100
23456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100

output:

100

result:

wrong answer 1st lines differ - expected: '1', found: '100'