QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #101401 | #5255. Greedy Drawers | DestroyXuanQuang | AC ✓ | 3ms | 3648kb | C++17 | 980b | 2023-04-29 14:58:25 | 2023-04-29 14:58:25 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int main() {
int n;
cin >> n;
vector<pii> a, b;
int x0 = 900;
int y0 = 100;
for(int i = 1; i <= n/8; ++i) {
for(int j = 1; j <= 3; ++j) a.push_back({x0 + 1, y0 + 7});
a.push_back({x0 + 2, y0 + 5});
a.push_back({x0 + 4, y0 + 3});
for(int j = 1; j <= 3; ++j) a.push_back({x0 + 6, y0 + 1});
for(int j = 1; j <= 3; ++j) b.push_back({x0 + 3, y0 + 8});
b.push_back({x0 + 5, y0 + 6});
b.push_back({x0 + 7, y0 + 4});
for(int j = 1; j <= 3; ++j) b.push_back({x0 + 8, y0 + 2});
x0 -= 10;
y0 += 10;
}
for(int i = 1; i <= n%8; ++i) {
a.push_back({1000, 1});
b.push_back({1000, 1});
}
for(auto x: a) printf("%d %d\n", x.first, x.second);
puts("");
for(auto x: b) printf("%d %d\n", x.first, x.second);
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 3ms
memory: 3592kb
input:
150
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #2:
score: 0
Accepted
time: 2ms
memory: 3540kb
input:
151
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #3:
score: 0
Accepted
time: 0ms
memory: 3496kb
input:
152
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #4:
score: 0
Accepted
time: 2ms
memory: 3612kb
input:
153
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #5:
score: 0
Accepted
time: 2ms
memory: 3528kb
input:
154
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #6:
score: 0
Accepted
time: 2ms
memory: 3632kb
input:
155
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #7:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
156
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #8:
score: 0
Accepted
time: 1ms
memory: 3580kb
input:
157
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #9:
score: 0
Accepted
time: 2ms
memory: 3588kb
input:
158
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #10:
score: 0
Accepted
time: 2ms
memory: 3648kb
input:
159
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #11:
score: 0
Accepted
time: 2ms
memory: 3520kb
input:
160
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #12:
score: 0
Accepted
time: 2ms
memory: 3528kb
input:
161
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #13:
score: 0
Accepted
time: 2ms
memory: 3528kb
input:
162
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #14:
score: 0
Accepted
time: 2ms
memory: 3484kb
input:
163
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #15:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
164
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #16:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
165
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #17:
score: 0
Accepted
time: 2ms
memory: 3616kb
input:
166
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #18:
score: 0
Accepted
time: 2ms
memory: 3640kb
input:
167
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #19:
score: 0
Accepted
time: 2ms
memory: 3524kb
input:
168
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy
Test #20:
score: 0
Accepted
time: 2ms
memory: 3524kb
input:
250
output:
901 107 901 107 901 107 902 105 904 103 906 101 906 101 906 101 891 117 891 117 891 117 892 115 894 113 896 111 896 111 896 111 881 127 881 127 881 127 882 125 884 123 886 121 886 121 886 121 871 137 871 137 871 137 872 135 874 133 876 131 876 131 876 131 861 147 861 147 861 147 862 145 864 143 866 ...
result:
ok you killed Janko's strategy