QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#416752#5255. Greedy Drawersgalen_colin#AC ✓1ms3888kbC++171.1kb2024-05-22 06:11:592024-05-22 06:11:59

Judging History

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

  • [2024-05-22 06:11:59]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3888kb
  • [2024-05-22 06:11:59]
  • 提交

answer

#include <bits/stdc++.h>

#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
#define int long long

using namespace std;

mt19937 rng(12334);

signed main(){
    fastio
    int n;
    cin >> n;
    vector<pair<int,int>> notebook = {{3,5}, {4,5}, {5,5}, {7,3}, {10,1}, {11,1}, {12,1}};
    vector<pair<int,int>> drawer = {{5,6},{6,6},{8,6},{13,4},{13,2},{14,2},{15,2}};

    int sz = 49;
    set<pair<int,int>> st;

    st.insert({49,49});
    while(st.size() < n/7){
        int x = rng()%sz+1;
        int y = rng()%sz+1;
        st.insert({x,y});
    }

    for(auto [x,y] : st){
        for(auto [a,b] : notebook){
            cout << x*20 + a << " " << y*20 + b << "\n";
        }
    }

    for(int i = 0; i < n%7; i++){
        cout << 1000 << " " << 1000-i << "\n";
    }

    cout << "\n";

    for(auto [x,y] : st){
        for(auto [a,b] : drawer){
            cout << x*20 + a << " " << y*20 + b << "\n";
        }
    }

    for(int i = 0; i < n%7; i++){
        cout << 1000 << " " << 1000-i << "\n";
    }

} 

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

150

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447 263
450 261
451 261
452 261
463 245
464 245
465 245
467...

result:

ok you killed Janko's strategy

Test #2:

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

input:

151

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447 263
450 261
451 261
452 261
463 245
464 245
465 245
467...

result:

ok you killed Janko's strategy

Test #3:

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

input:

152

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447 263
450 261
451 261
452 261
463 245
464 245
465 245
467...

result:

ok you killed Janko's strategy

Test #4:

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

input:

153

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447 263
450 261
451 261
452 261
463 245
464 245
465 245
467...

result:

ok you killed Janko's strategy

Test #5:

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

input:

154

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447 263
450 261
451 261
452 261
463 245
464 245
465 245
467...

result:

ok you killed Janko's strategy

Test #6:

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

input:

155

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447 263
450 261
451 261
452 261
463 245
464 245
465 245
467...

result:

ok you killed Janko's strategy

Test #7:

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

input:

156

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447 263
450 261
451 261
452 261
463 245
464 245
465 245
467...

result:

ok you killed Janko's strategy

Test #8:

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

input:

157

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447 263
450 261
451 261
452 261
463 245
464 245
465 245
467...

result:

ok you killed Janko's strategy

Test #9:

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

input:

158

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447 263
450 261
451 261
452 261
463 245
464 245
465 245
467...

result:

ok you killed Janko's strategy

Test #10:

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

input:

159

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447 263
450 261
451 261
452 261
463 245
464 245
465 245
467...

result:

ok you killed Janko's strategy

Test #11:

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

input:

160

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447 263
450 261
451 261
452 261
463 245
464 245
465 245
467...

result:

ok you killed Janko's strategy

Test #12:

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

input:

161

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
123 285
124 285
125 285
127 283
130 281
131 281
132 281
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447...

result:

ok you killed Janko's strategy

Test #13:

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

input:

162

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
123 285
124 285
125 285
127 283
130 281
131 281
132 281
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447...

result:

ok you killed Janko's strategy

Test #14:

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

input:

163

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
123 285
124 285
125 285
127 283
130 281
131 281
132 281
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447...

result:

ok you killed Janko's strategy

Test #15:

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

input:

164

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
123 285
124 285
125 285
127 283
130 281
131 281
132 281
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447...

result:

ok you killed Janko's strategy

Test #16:

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

input:

165

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
123 285
124 285
125 285
127 283
130 281
131 281
132 281
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447...

result:

ok you killed Janko's strategy

Test #17:

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

input:

166

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
123 285
124 285
125 285
127 283
130 281
131 281
132 281
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447...

result:

ok you killed Janko's strategy

Test #18:

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

input:

167

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
123 285
124 285
125 285
127 283
130 281
131 281
132 281
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447...

result:

ok you killed Janko's strategy

Test #19:

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

input:

168

output:

43 485
44 485
45 485
47 483
50 481
51 481
52 481
123 285
124 285
125 285
127 283
130 281
131 281
132 281
203 305
204 305
205 305
207 303
210 301
211 301
212 301
223 505
224 505
225 505
227 503
230 501
231 501
232 501
363 785
364 785
365 785
367 783
370 781
371 781
372 781
443 265
444 265
445 265
447...

result:

ok you killed Janko's strategy

Test #20:

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

input:

250

output:

23 485
24 485
25 485
27 483
30 481
31 481
32 481
43 485
44 485
45 485
47 483
50 481
51 481
52 481
63 585
64 585
65 585
67 583
70 581
71 581
72 581
123 245
124 245
125 245
127 243
130 241
131 241
132 241
123 285
124 285
125 285
127 283
130 281
131 281
132 281
203 305
204 305
205 305
207 303
210 301
2...

result:

ok you killed Janko's strategy