QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#410506 | #5255. Greedy Drawers | ucup-team1716# | AC ✓ | 0ms | 3884kb | C++20 | 882b | 2024-05-14 05:45:37 | 2024-05-14 05:45:39 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector<int> nx = {0, -1, -1, -1}, ny = {0, -1, 2, 2};
//Notebook
int nowx = 500, nowy = 500;
for(int i=0; i<150; i++)
{
cout << nowx << " " << nowy << "\n";
nowx += nx[i%4];
nowy += ny[i%4];
}
for(int i=150; i<n; i++)
{
cout << "1 1000\n";
}
cout << "\n";
//Drawer
nx = {-1, 0, -1, -1}, ny = {0, 0, 1, 2};
nowx = 500, nowy = 500;
for(int i=0; i<150; i++)
{
cout << nowx << " " << nowy << "\n";
if(i==0) continue;
nowx += nx[i%4];
nowy += ny[i%4];
}
for(int i=150; i<n; i++)
{
cout << "1 1000\n";
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3872kb
input:
150
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #2:
score: 0
Accepted
time: 0ms
memory: 3840kb
input:
151
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #3:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
152
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #4:
score: 0
Accepted
time: 0ms
memory: 3468kb
input:
153
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #5:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
154
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #6:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
155
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #7:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
156
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #8:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
157
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #9:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
158
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #10:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
159
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #11:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
160
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #12:
score: 0
Accepted
time: 0ms
memory: 3876kb
input:
161
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #13:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
162
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #14:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
163
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #15:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
164
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #16:
score: 0
Accepted
time: 0ms
memory: 3528kb
input:
165
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #17:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
166
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #18:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
167
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #19:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
168
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy
Test #20:
score: 0
Accepted
time: 0ms
memory: 3884kb
input:
250
output:
500 500 500 500 499 499 498 501 497 503 497 503 496 502 495 504 494 506 494 506 493 505 492 507 491 509 491 509 490 508 489 510 488 512 488 512 487 511 486 513 485 515 485 515 484 514 483 516 482 518 482 518 481 517 480 519 479 521 479 521 478 520 477 522 476 524 476 524 475 523 474 525 473 527 473 ...
result:
ok you killed Janko's strategy