QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #145135 | #5255. Greedy Drawers | PhantomThreshold | AC ✓ | 2ms | 3656kb | C++20 | 958b | 2023-08-21 22:21:36 | 2023-08-21 22:21:37 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int lim=900;
vector<pair<int,int>> ans1,ans2;
void gao(int mn){
ans1.emplace_back(mn+1,mn+6);
ans1.emplace_back(mn+1,mn+6);
ans1.emplace_back(mn+1,mn+6);
ans1.emplace_back(mn+2,mn+5);
ans1.emplace_back(mn+3,mn+4);
ans1.emplace_back(mn+3,mn+4);
ans1.emplace_back(mn+3,mn+4);
ans2.emplace_back(mn+1,mn+6);
ans2.emplace_back(mn+1,mn+6);
ans2.emplace_back(mn+1,mn+6);
ans2.emplace_back(mn+2,mn+6);
ans2.emplace_back(mn+3,mn+5);
ans2.emplace_back(mn+4,mn+4);
ans2.emplace_back(mn+4,mn+4);
}
int main(){
ios_base::sync_with_stdio(false);
int n;
cin >> n;
for (int i=0;i<n/7;i++){
int now=lim-10*i;
gao(now);
}
int rest=n-ans1.size();
for (;rest--;){
ans1.emplace_back(1,1);
ans2.emplace_back(1,1);
}
for (auto [x,y]:ans1) cout << x << " " << y << "\n";
cout << "\n";
for (auto [x,y]:ans2) cout << x << " " << y << "\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3472kb
input:
150
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #2:
score: 0
Accepted
time: 0ms
memory: 3544kb
input:
151
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #3:
score: 0
Accepted
time: 1ms
memory: 3476kb
input:
152
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #4:
score: 0
Accepted
time: 2ms
memory: 3440kb
input:
153
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #5:
score: 0
Accepted
time: 1ms
memory: 3484kb
input:
154
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #6:
score: 0
Accepted
time: 1ms
memory: 3592kb
input:
155
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #7:
score: 0
Accepted
time: 1ms
memory: 3488kb
input:
156
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #8:
score: 0
Accepted
time: 1ms
memory: 3444kb
input:
157
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #9:
score: 0
Accepted
time: 0ms
memory: 3444kb
input:
158
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #10:
score: 0
Accepted
time: 1ms
memory: 3436kb
input:
159
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #11:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
160
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #12:
score: 0
Accepted
time: 1ms
memory: 3480kb
input:
161
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #13:
score: 0
Accepted
time: 1ms
memory: 3656kb
input:
162
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #14:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
163
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #15:
score: 0
Accepted
time: 1ms
memory: 3548kb
input:
164
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #16:
score: 0
Accepted
time: 1ms
memory: 3488kb
input:
165
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #17:
score: 0
Accepted
time: 0ms
memory: 3432kb
input:
166
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #18:
score: 0
Accepted
time: 1ms
memory: 3432kb
input:
167
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #19:
score: 0
Accepted
time: 1ms
memory: 3436kb
input:
168
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy
Test #20:
score: 0
Accepted
time: 0ms
memory: 3436kb
input:
250
output:
901 906 901 906 901 906 902 905 903 904 903 904 903 904 891 896 891 896 891 896 892 895 893 894 893 894 893 894 881 886 881 886 881 886 882 885 883 884 883 884 883 884 871 876 871 876 871 876 872 875 873 874 873 874 873 874 861 866 861 866 861 866 862 865 863 864 863 864 863 864 851 856 851 856 851 ...
result:
ok you killed Janko's strategy