QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#417774#7979. 棋盘kkkgjyismine40 339ms9672kbPython3888b2024-05-22 22:01:002024-05-22 22:01:02

Judging History

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

  • [2024-05-22 22:01:02]
  • 评测
  • 测评结果：0
  • 用时：339ms
  • 内存：9672kb
查看
  • [2024-05-22 22:01:00]
  • 提交

answer

n = 960
f = [1,1] 
ax = [1] * n 
ay = [1] * n 
id = [1] * n
for i in range (2,n) : 
    f.append(f[-1]+f[-2])
for i in range (1,n) :
    if i%2==1 :
        if i==1 :
            ax[i],ay[i],id[i]=ax[i-1]+1,ay[i-1],2
        else :
            ax[i],ay[i],id[i]=ax[i-1]+1,ay[i-1],id[i-1]+1
    else :
        if i==2 :
            ax[i],ay[i],id[i]=ax[i-1],ay[i-1]+1,id[i-1]+2
        else :
            ax[i],ay[i],id[i]=ax[i-1],ay[i-1]+1,id[i-1]+3
k, q, x, y = [int(t) for t in input().split(' ')]
print(n-2)
print(1,1)
print(2,1)
for i in range (2,n//4+1) :
    print(i-1,i)
    print(i,i)
    print(i+1,i)
    print(i+1,i-1)
for i in range (0,q) :
    s = [0] * n
    now = int (input())
    for j in range (n-1,-1,-1) :
        if now >= f[j] : 
            s[id[j]-1]=1
            now -= f[j]
    for c in s:
        print(c, end='')
    print()
Source code, Language: Python3

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 339ms
memory: 9624kb

input:

3 999 1000 340
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
...

output:

958
1 1
2 1
1 2
2 2
3 2
3 1
2 3
3 3
4 3
4 2
3 4
4 4
5 4
5 3
4 5
5 5
6 5
6 4
5 6
6 6
7 6
7 5
6 7
7 7
8 7
8 6
7 8
8 8
9 8
9 7
8 9
9 9
10 9
10 8
9 10
10 10
11 10
11 9
10 11
11 11
12 11
12 10
11 12
12 12
13 12
13 11
12 13
13 13
14 13
14 12
13 14
14 14
15 14
15 13
14 15
15 15
16 15
16 14
15 16
16 16
17 1...

result:

wrong answer Wrong[0]

Subtask #2:

score: 0
Time Limit Exceeded

Test #2:

score: 0
Time Limit Exceeded

input:

12 10000 1000 340
358908473750
36343501002
904324605639
453955046266
725478753662
218319365131
882878650993
648345848966
474401697383
722377018680
718743783955
748051292505
167886140898
411111004914
327825244967
990026144963
623309580364
970889332700
319445927842
527624602835
453135227321
1153226125...

output:

958
1 1
2 1
1 2
2 2
3 2
3 1
2 3
3 3
4 3
4 2
3 4
4 4
5 4
5 3
4 5
5 5
6 5
6 4
5 6
6 6
7 6
7 5
6 7
7 7
8 7
8 6
7 8
8 8
9 8
9 7
8 9
9 9
10 9
10 8
9 10
10 10
11 10
11 9
10 11
11 11
12 11
12 10
11 12
12 12
13 12
13 11
12 13
13 13
14 13
14 12
13 14
14 14
15 14
15 13
14 15
15 15
16 15
16 14
15 16
16 16
17 1...

result:

Subtask #3:

score: 0
Time Limit Exceeded

Test #5:

score: 0
Time Limit Exceeded

input:

100 10000 1000 340
87490023455826213450979333037504606824522062808297739018786336978222089712660133428564103979384831
874900289913204769749000879539227331559680630241808944569515663934025397982898503777823815274323967
8749002899116133353924895735921513229471979456689635148877567298640178774668643967...

output:

958
1 1
2 1
1 2
2 2
3 2
3 1
2 3
3 3
4 3
4 2
3 4
4 4
5 4
5 3
4 5
5 5
6 5
6 4
5 6
6 6
7 6
7 5
6 7
7 7
8 7
8 6
7 8
8 8
9 8
9 7
8 9
9 9
10 9
10 8
9 10
10 10
11 10
11 9
10 11
11 11
12 11
12 10
11 12
12 12
13 12
13 11
12 13
13 13
14 13
14 12
13 14
14 14
15 14
15 13
14 15
15 15
16 15
16 14
15 16
16 16
17 1...

result:

Subtask #4:

score: 0
Time Limit Exceeded

Test #7:

score: 0
Time Limit Exceeded

input:

100 10000 990 310
4083451712318559926139496762164571032902328806667934236880329773320213539959944736095945843081512968
7811890641057562314768022152641517082686481268288006737090208624016586608183953908313798353213188661
97358161226180890688421784730819518002666166790210320310558753031161862165361257...

output:

958
1 1
2 1
1 2
2 2
3 2
3 1
2 3
3 3
4 3
4 2
3 4
4 4
5 4
5 3
4 5
5 5
6 5
6 4
5 6
6 6
7 6
7 5
6 7
7 7
8 7
8 6
7 8
8 8
9 8
9 7
8 9
9 9
10 9
10 8
9 10
10 10
11 10
11 9
10 11
11 11
12 11
12 10
11 12
12 12
13 12
13 11
12 13
13 13
14 13
14 12
13 14
14 14
15 14
15 13
14 15
15 15
16 15
16 14
15 16
16 16
17 1...

result:

Subtask #5:

score: 0
Time Limit Exceeded

Test #9:

score: 0
Time Limit Exceeded

input:

100 10000 1050 260
8749002899132047697490008908470485461412677723566863434996575047286849703722697797645542008396185599
8749002899132047697490008908470485461412677699052921091826559946707718798046219210886366418022957055
7655377536740541735303757766642121742076255665128332760334129720709510994307378...

output:

958
1 1
2 1
1 2
2 2
3 2
3 1
2 3
3 3
4 3
4 2
3 4
4 4
5 4
5 3
4 5
5 5
6 5
6 4
5 6
6 6
7 6
7 5
6 7
7 7
8 7
8 6
7 8
8 8
9 8
9 7
8 9
9 9
10 9
10 8
9 10
10 10
11 10
11 9
10 11
11 11
12 11
12 10
11 12
12 12
13 12
13 11
12 13
13 13
14 13
14 12
13 14
14 14
15 14
15 13
14 15
15 15
16 15
16 14
15 16
16 16
17 1...

result:

Subtask #6:

score: 0
Time Limit Exceeded

Test #11:

score: 0
Time Limit Exceeded

input:

100 10000 1050 240
8749002899132047697490008908470485461412677723572849734285100881333676956761384191490477496469520383
874886939179415873527191365288672777702448917037688119492655525651250910013304087281579324577152991
87490028991320476974900089084704854614126777235728490149522637601883528949454159...

output:

958
1 1
2 1
1 2
2 2
3 2
3 1
2 3
3 3
4 3
4 2
3 4
4 4
5 4
5 3
4 5
5 5
6 5
6 4
5 6
6 6
7 6
7 5
6 7
7 7
8 7
8 6
7 8
8 8
9 8
9 7
8 9
9 9
10 9
10 8
9 10
10 10
11 10
11 9
10 11
11 11
12 11
12 10
11 12
12 12
13 12
13 11
12 13
13 13
14 13
14 12
13 14
14 14
15 14
15 13
14 15
15 15
16 15
16 14
15 16
16 16
17 1...

result:

Subtask #7:

score: 0
Wrong Answer

Test #13:

score: 0
Wrong Answer
time: 5ms
memory: 9672kb

input:

100 1 980 260
8749002899132047697490008908470485461309833682610292204604841418296589481615503153703163411103219711

output:

958
1 1
2 1
1 2
2 2
3 2
3 1
2 3
3 3
4 3
4 2
3 4
4 4
5 4
5 3
4 5
5 5
6 5
6 4
5 6
6 6
7 6
7 5
6 7
7 7
8 7
8 6
7 8
8 8
9 8
9 7
8 9
9 9
10 9
10 8
9 10
10 10
11 10
11 9
10 11
11 11
12 11
12 10
11 12
12 12
13 12
13 11
12 13
13 13
14 13
14 12
13 14
14 14
15 14
15 13
14 15
15 15
16 15
16 14
15 16
16 16
17 1...

result:

wrong answer Wrong[0]

Subtask #8:

score: 0
Time Limit Exceeded

Test #19:

score: 0
Time Limit Exceeded

input:

100 10000 960 240
8749002899132047697015724510954438324957730968977252383122989921226002617013223698533483281626692607
8749002899132047697490008908470485461412677720507858663971304708923117942496885325656574463725010943
87148271065573131361716885470369961093519598137825155235803895087505468828694702...

output:

958
1 1
2 1
1 2
2 2
3 2
3 1
2 3
3 3
4 3
4 2
3 4
4 4
5 4
5 3
4 5
5 5
6 5
6 4
5 6
6 6
7 6
7 5
6 7
7 7
8 7
8 6
7 8
8 8
9 8
9 7
8 9
9 9
10 9
10 8
9 10
10 10
11 10
11 9
10 11
11 11
12 11
12 10
11 12
12 12
13 12
13 11
12 13
13 13
14 13
14 12
13 14
14 14
15 14
15 13
14 15
15 15
16 15
16 14
15 16
16 16
17 1...

result:
English 繁體中文 简体中文

Server Time: 2024-12-03 06:34:39 | OpenSource Project