Submission #831453

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
831453	2023-08-20T09:15:33 Z	Halym2007	Martian DNA (IOI16_dna)	C++11	36 / 100	17 ms	404 KB

#include <bits/stdc++.h>
using namespace std;
#include "dna.h"

//string s;
//int tests;
//
//bool make_test(std::string p) {
//	tests++;
//	for (int i = 0; i < p.size(); i++) {
//		if (p[i] != '0' && p[i] != '1') {
//			return false;
//		}
//	}
//	string ss = p + "#" + s;
//	vector<int> pr(ss.size() + 1);
//	pr[0] = -1;
//	bool answer = false;
//	for (int i = 1; i <= ss.size(); i++) {
//		int k = pr[i - 1];
//		while (k >= 0 && ss[k] != ss[i - 1])
//			k = pr[k];
//		pr[i] = k + 1;
//		if (pr[i] == p.size()) {
//			answer = true;
//			break;
//		}
//	} 
//	return answer;
//}



string analyse(int n, int t) {
	bool a1 = make_test ("0");
	bool a2 = make_test ("1");
	string jog = ""; 
	if (!a1 and !a2) return jog;
	if (!a1) {
		while (make_test(jog + "1")) {
			jog += '1';
		} 
		return jog;
	}
	else if (!a2) {
		while (make_test(jog + "0")) {
			jog += '0';
		} 
		return jog;
	}
	while (1) {
		if (make_test(jog + "0")) {
	 		jog += '0';
		}
		else if (make_test(jog + "1")) {
		 	jog += '1';
		}
		else break;
	}
	while (1) {
		if (make_test("0" + jog)) {
	 		jog = '0' + jog;
		}
		else if (make_test("1" + jog)) {
		 	jog = '1' + jog;
		}
		else break;
	}
	return jog;
}



//int main() {
//    int t;
//    cin >> s >> t;
//    string ans = analyse(s.size(), t);
//	cout << tests << endl << ans << endl;
//    return 0;
//}

Compilation message

grader.cpp: In function 'bool make_test(std::string)':
grader.cpp:14:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for (int i = 0; i < p.size(); i++) {
      |                  ~~^~~~~~~~~~
grader.cpp:23:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  for (int i = 1; i <= ss.size(); i++) {
      |                  ~~^~~~~~~~~~~~
grader.cpp:28:13: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |   if (pr[i] == p.size()) {

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	300 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	304 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	304 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct

Subtask #2
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	304 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	308 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	300 KB	Output is correct
14	Correct	0 ms	304 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	304 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	304 KB	Output is correct
34	Correct	1 ms	308 KB	Output is correct

Subtask #3
0 / 64.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	304 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	304 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Incorrect	10 ms	388 KB	Too many tests
23	Incorrect	14 ms	364 KB	Too many tests
24	Incorrect	16 ms	344 KB	Too many tests
25	Incorrect	17 ms	340 KB	Too many tests
26	Incorrect	15 ms	368 KB	Too many tests
27	Incorrect	7 ms	340 KB	Too many tests
28	Incorrect	9 ms	340 KB	Too many tests
29	Correct	5 ms	340 KB	Output is correct
30	Correct	5 ms	340 KB	Output is correct
31	Incorrect	11 ms	340 KB	Too many tests
32	Correct	5 ms	340 KB	Output is correct
33	Incorrect	10 ms	340 KB	Too many tests
34	Incorrect	10 ms	404 KB	Too many tests
35	Incorrect	9 ms	388 KB	Too many tests
36	Incorrect	9 ms	340 KB	Too many tests
37	Incorrect	10 ms	404 KB	Too many tests
38	Incorrect	8 ms	384 KB	Too many tests
39	Incorrect	11 ms	396 KB	Too many tests

Submission #831453

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 25.0 / 25.0

Subtask #3 0 / 64.0

Subtask #1
11.0 / 11.0

Subtask #2
25.0 / 25.0

Subtask #3
0 / 64.0