QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#236010#7639. Forbidden SetIANYEYZAC ✓1ms3568kbC++142.5kb2023-11-03 15:07:502023-11-03 15:07:51

Judging History

This is the latest submission verdict.

  • [2023-11-03 15:07:51]
  • Judged
  • Verdict: AC
  • Time: 1ms
  • Memory: 3568kb
  • [2023-11-03 15:07:50]
  • Submitted

answer

#include<iostream>
using namespace std;
int ans[2][2][2][2][2][2];
int chosen[19];
int mp[20] = {0,1,6,6,2,6,3,6,4,5};
int flag[19],n,d,ans1 = 0x3f3f3f3f;
int main()
{
	ans[1][1][1][1][1][1] = -1;
	ans[1][1][1][1][1][0] = -1;
	ans[1][1][1][1][0][1] = -1;
	ans[1][1][1][1][0][0] = 89;
	ans[1][1][1][0][1][1] = -1;
	ans[1][1][1][0][1][0] = -1;
	ans[1][1][1][0][0][1] = -1;
	ans[1][1][1][0][0][0] = 89;
	ans[1][1][0][1][1][1] = -1;
	ans[1][1][0][1][1][0] = 449;
	ans[1][1][0][1][0][1] = -1;
	ans[1][1][0][1][0][0] = 89;
	ans[1][1][0][0][1][1] = -1;
	ans[1][1][0][0][1][0] = 449;
	ans[1][1][0][0][0][1] = -1;
	ans[1][1][0][0][0][0] = 89;
	ans[1][0][1][1][1][1] = 11;
	ans[1][0][1][1][1][0] = 11;
	ans[1][0][1][1][0][1] = 11;
	ans[1][0][1][1][0][0] = 11;
	ans[1][0][1][0][1][1] = 11;
	ans[1][0][1][0][1][0] = 11;
	ans[1][0][1][0][0][1] = 11;
	ans[1][0][1][0][0][0] = 11;
	ans[1][0][0][1][1][1] = 11;
	ans[1][0][0][1][1][0] = 11;
	ans[1][0][0][1][0][1] = 11;
	ans[1][0][0][1][0][0] = 11;
	ans[1][0][0][0][1][1] = 11;
	ans[1][0][0][0][1][0] = 11;
	ans[1][0][0][0][0][1] = 11;
	ans[1][0][0][0][0][0] = 11;
	ans[0][1][1][1][1][1] = -1;
	ans[0][1][1][1][1][0] = -1;
	ans[0][1][1][1][0][1] = -1;
	ans[0][1][1][1][0][0] = 89;
	ans[0][1][1][0][1][1] = -1;
	ans[0][1][1][0][1][0] = -1;
	ans[0][1][1][0][0][1] = -1;
	ans[0][1][1][0][0][0] = 89;
	ans[0][1][0][1][1][1] = -1;
	ans[0][1][0][1][1][0] = 409;
	ans[0][1][0][1][0][1] = -1;
	ans[0][1][0][1][0][0] = 89;
	ans[0][1][0][0][1][1] = -1;
	ans[0][1][0][0][1][0] = 409;
	ans[0][1][0][0][0][1] = -1;
	ans[0][1][0][0][0][0] = 89;
	ans[0][0][1][1][1][1] = 11;
	ans[0][0][1][1][1][0] = 11;
	ans[0][0][1][1][0][1] = 11;
	ans[0][0][1][1][0][0] = 11;
	ans[0][0][1][0][1][1] = 11;
	ans[0][0][1][0][1][0] = 11;
	ans[0][0][1][0][0][1] = 11;
	ans[0][0][1][0][0][0] = 11;
	ans[0][0][0][1][1][1] = 11;
	ans[0][0][0][1][1][0] = 11;
	ans[0][0][0][1][0][1] = 11;
	ans[0][0][0][1][0][0] = 11;
	ans[0][0][0][0][1][1] = 11;
	ans[0][0][0][0][1][0] = 11;
	ans[0][0][0][0][0][1] = 11;
	ans[0][0][0][0][0][0] = 11;
	cin >> n;
	for(int i = 1;i <= n;i++) {
		cin >> d;
		if(d == 2 || d == 3 || d == 5 || d == 7) {
			//ans1 = min(ans1,d);
			flag[d] = 1;
		} else {
			chosen[mp[d]] = 1;
		}
	}
	if(flag[2] != 1) {
		cout << 2 << "\n";
	} else if(flag[3] != 1) {
		cout << 3 << "\n";
	} else if(flag[5] != 1) {
		cout << 5 << "\n";
	} else if(flag[7] != 1) {
		cout << 7 << "\n";
	} else {
		ans1 = ans[chosen[0]][chosen[1]][chosen[2]][chosen[3]][chosen[4]][chosen[5]];
		cout << ans1 << "\n";
	}
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3512kb

input:

7
0
1
2
4
6
8
9

output:

3

result:

ok 1 number(s): "3"

Test #2:

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

input:

9
0
1
2
3
5
6
7
8
9

output:

-1

result:

ok 1 number(s): "-1"

Test #3:

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

input:

9
0
2
3
4
5
6
7
8
9

output:

11

result:

ok 1 number(s): "11"

Test #4:

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

input:

9
0
1
3
4
5
6
7
8
9

output:

2

result:

ok 1 number(s): "2"

Test #5:

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

input:

9
0
1
2
4
5
6
7
8
9

output:

3

result:

ok 1 number(s): "3"

Test #6:

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

input:

9
0
1
2
3
4
6
7
8
9

output:

5

result:

ok 1 number(s): "5"

Test #7:

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

input:

9
0
1
2
3
4
5
7
8
9

output:

-1

result:

ok 1 number(s): "-1"

Test #8:

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

input:

9
0
1
2
3
4
5
6
8
9

output:

7

result:

ok 1 number(s): "7"

Test #9:

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

input:

9
0
1
2
3
4
5
6
7
9

output:

-1

result:

ok 1 number(s): "-1"

Test #10:

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

input:

9
0
1
2
3
4
5
6
7
8

output:

-1

result:

ok 1 number(s): "-1"

Test #11:

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

input:

4
1
3
7
9

output:

2

result:

ok 1 number(s): "2"

Test #12:

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

input:

7
1
2
3
4
5
7
8

output:

-1

result:

ok 1 number(s): "-1"

Test #13:

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

input:

8
0
1
2
3
4
5
7
8

output:

-1

result:

ok 1 number(s): "-1"

Test #14:

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

input:

8
1
2
3
4
5
6
7
8

output:

-1

result:

ok 1 number(s): "-1"

Test #15:

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

input:

5
1
2
3
5
7

output:

89

result:

ok 1 number(s): "89"

Test #16:

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

input:

6
1
2
3
5
7
8

output:

409

result:

ok 1 number(s): "409"

Test #17:

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

input:

8
0
1
2
3
5
6
7
8

output:

449

result:

ok 1 number(s): "449"

Test #18:

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

input:

5
2
3
5
7
9

output:

11

result:

ok 1 number(s): "11"

Test #19:

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

input:

6
1
2
4
5
7
8

output:

3

result:

ok 1 number(s): "3"

Test #20:

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

input:

8
0
1
2
4
5
7
8
9

output:

3

result:

ok 1 number(s): "3"

Test #21:

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

input:

8
0
1
3
5
6
7
8
9

output:

2

result:

ok 1 number(s): "2"

Test #22:

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

input:

8
0
2
3
5
6
7
8
9

output:

11

result:

ok 1 number(s): "11"

Test #23:

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

input:

8
0
2
4
5
6
7
8
9

output:

3

result:

ok 1 number(s): "3"

Test #24:

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

input:

7
0
2
3
5
6
7
8

output:

11

result:

ok 1 number(s): "11"

Test #25:

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

input:

8
2
3
4
5
6
7
8
9

output:

11

result:

ok 1 number(s): "11"

Test #26:

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

input:

8
0
1
2
5
6
7
8
9

output:

3

result:

ok 1 number(s): "3"

Test #27:

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

input:

1
2

output:

3

result:

ok 1 number(s): "3"

Test #28:

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

input:

10
0
1
2
3
4
5
6
7
8
9

output:

-1

result:

ok 1 number(s): "-1"

Test #29:

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

input:

7
0
2
3
5
6
8
9

output:

7

result:

ok 1 number(s): "7"

Test #30:

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

input:

8
1
2
3
4
5
6
7
9

output:

-1

result:

ok 1 number(s): "-1"

Test #31:

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

input:

4
0
2
6
7

output:

3

result:

ok 1 number(s): "3"

Test #32:

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

input:

5
2
3
4
6
8

output:

5

result:

ok 1 number(s): "5"

Test #33:

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

input:

6
0
2
3
4
5
8

output:

7

result:

ok 1 number(s): "7"

Test #34:

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

input:

3
1
5
7

output:

2

result:

ok 1 number(s): "2"

Test #35:

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

input:

3
1
4
9

output:

2

result:

ok 1 number(s): "2"

Test #36:

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

input:

6
2
3
4
6
7
9

output:

5

result:

ok 1 number(s): "5"

Test #37:

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

input:

7
1
2
3
4
5
6
8

output:

7

result:

ok 1 number(s): "7"

Test #38:

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

input:

6
0
1
3
5
8
9

output:

2

result:

ok 1 number(s): "2"

Test #39:

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

input:

3
1
3
4

output:

2

result:

ok 1 number(s): "2"

Test #40:

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

input:

4
1
5
6
9

output:

2

result:

ok 1 number(s): "2"

Test #41:

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

input:

7
0
2
3
5
6
7
9

output:

11

result:

ok 1 number(s): "11"

Test #42:

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

input:

4
0
3
7
9

output:

2

result:

ok 1 number(s): "2"

Extra Test:

score: 0
Extra Test Passed