QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#71414#5255. Greedy DrawersSorting#WA 2ms3344kbC++816b2023-01-09 22:39:592023-03-17 01:51:18

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-03-17 01:51:18]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3344kb
  • [2023-01-09 22:39:59]
  • 提交

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;
	for(int i=0; i<25 ;i++){
		int iu=n/25+(i<n%25)-1;
		int cx=20*i+1;
		int cy=20*(24-i)+1;
		for(int i=2; i<=iu-1 ;i++){
			v1.push_back({cx+i,cy+iu-i});
			v2.push_back({cx+i,cy+iu-i+1});
		}
		v2.push_back({cx+iu,cy+2});
		v2.push_back({cx+iu+1,cy+2});v1.push_back({cx+iu-1,cy});
		v1.push_back({cx+1,cy+iu-2});
		v2.push_back({cx+2,cy+iu});v1.push_back({cx,cy+iu-2});
	}
	//cout << v1.size() << endl;
	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';
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 2ms
memory: 3344kb

input:

150

output:

3 984
4 983
5 982
5 981
2 984
1 984
23 964
24 963
25 962
25 961
22 964
21 964
43 944
44 943
45 942
45 941
42 944
41 944
63 924
64 923
65 922
65 921
62 924
61 924
83 904
84 903
85 902
85 901
82 904
81 904
103 884
104 883
105 882
105 881
102 884
101 884
123 864
124 863
125 862
125 861
122 864
121 864
...

result:

wrong answer Janko passed your test!