QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #71406 | #5255. Greedy Drawers | Sorting# | WA | 2ms | 3480kb | C++ | 552b | 2023-01-09 22:14:19 | 2023-03-17 01:51:06 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define fi first
#define se second
int n,m,k;
vector<pair<int,int> >v1,v2;
int main(){
ios::sync_with_stdio(false);cin.tie(0);
cin >> n;
int iu=n+1;
for(int i=2; i<=iu-1 ;i++){
v1.push_back({i,iu-i});
v2.push_back({i,iu-i+1});
}
v2.push_back({iu,2});
v1.push_back({1,iu-2});
for(auto c:v1) cout << c.fi << ' ' << c.se+500 << '\n';
cout << '\n';
for(auto c:v2) cout << c.fi << ' ' << c.se+500 << '\n';
cout << '\n';
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 3480kb
input:
150
output:
2 649 3 648 4 647 5 646 6 645 7 644 8 643 9 642 10 641 11 640 12 639 13 638 14 637 15 636 16 635 17 634 18 633 19 632 20 631 21 630 22 629 23 628 24 627 25 626 26 625 27 624 28 623 29 622 30 621 31 620 32 619 33 618 34 617 35 616 36 615 37 614 38 613 39 612 40 611 41 610 42 609 43 608 44 607 45 606 ...
result:
wrong answer Janko passed your test!