QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#89217#5255. Greedy DrawerswhateverAC ✓3ms3736kbC++141.1kb2023-03-19 11:43:022023-03-19 11:43:04

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-03-19 11:43:04]
  • 评测
  • 测评结果:AC
  • 用时:3ms
  • 内存:3736kb
  • [2023-03-19 11:43:02]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> note, draw;
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  #ifdef ALEX_WEI
    FILE* IN = freopen("1.in", "r", stdin);
    FILE* OUT = freopen("1.out", "w", stdout);
  #endif
  int n, c = 0, d = 1001;
  cin >> n;
  while(n >= 5) {
    note.push_back({c + 1, d - 3});
    note.push_back({c + 2, d - 5});
    note.push_back({c + 5, d - 7});
    note.push_back({c + 7, d - 9});
    note.push_back({c + 8, d - 10});
    draw.push_back({c + 3, d - 1});
    draw.push_back({c + 4, d - 2});
    draw.push_back({c + 6, d - 4});
    draw.push_back({c + 9, d - 6});
    draw.push_back({c + 10, d - 8});
    c += 10, d -= 10, n -= 5;
  }
  while(n) {
    note.push_back({c + 1, d - 2});
    draw.push_back({c + 2, d - 1});
    c += 2, d -= 2, n--;
  }
  for(auto it : note) cout << it.first << " " << it.second << "\n";
  cout << "\n";
  for(auto it : draw) cout << it.first << " " << it.second << "\n";
  cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
  return 0;
}
/*
g++ G.cpp -o G -std=c++14 -O2 -DALEX_WEI
*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

150

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #2:

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

input:

151

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #3:

score: 0
Accepted
time: 3ms
memory: 3600kb

input:

152

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #4:

score: 0
Accepted
time: 2ms
memory: 3628kb

input:

153

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #5:

score: 0
Accepted
time: 2ms
memory: 3736kb

input:

154

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #6:

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

input:

155

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #7:

score: 0
Accepted
time: 2ms
memory: 3632kb

input:

156

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #8:

score: 0
Accepted
time: 3ms
memory: 3660kb

input:

157

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #9:

score: 0
Accepted
time: 2ms
memory: 3692kb

input:

158

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #10:

score: 0
Accepted
time: 2ms
memory: 3644kb

input:

159

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #11:

score: 0
Accepted
time: 2ms
memory: 3672kb

input:

160

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #12:

score: 0
Accepted
time: 2ms
memory: 3656kb

input:

161

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #13:

score: 0
Accepted
time: 2ms
memory: 3608kb

input:

162

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #14:

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

input:

163

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #15:

score: 0
Accepted
time: 2ms
memory: 3676kb

input:

164

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #16:

score: 0
Accepted
time: 2ms
memory: 3616kb

input:

165

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #17:

score: 0
Accepted
time: 2ms
memory: 3680kb

input:

166

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #18:

score: 0
Accepted
time: 3ms
memory: 3664kb

input:

167

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #19:

score: 0
Accepted
time: 2ms
memory: 3680kb

input:

168

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy

Test #20:

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

input:

250

output:

1 998
2 996
5 994
7 992
8 991
11 988
12 986
15 984
17 982
18 981
21 978
22 976
25 974
27 972
28 971
31 968
32 966
35 964
37 962
38 961
41 958
42 956
45 954
47 952
48 951
51 948
52 946
55 944
57 942
58 941
61 938
62 936
65 934
67 932
68 931
71 928
72 926
75 924
77 922
78 921
81 918
82 916
85 914
87 9...

result:

ok you killed Janko's strategy