QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#71409#5255. Greedy DrawersSorting#WA 2ms3544kbC++663b2023-01-09 22:23:062023-03-17 01:51:11

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:11]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3544kb
  • [2023-01-09 22:23:06]
  • 提交

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+(n%25<i)+1;
		int cx=20*i;
		int cy=20*(24-i);
		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});
		v1.push_back({cx+1,cy+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';
}

详细

Test #1:

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

input:

150

output:

2 985
3 984
4 983
5 982
6 981
1 985
22 966
23 965
24 964
25 963
26 962
27 961
21 966
42 946
43 945
44 944
45 943
46 942
47 941
41 946
62 926
63 925
64 924
65 923
66 922
67 921
61 926
82 906
83 905
84 904
85 903
86 902
87 901
81 906
102 886
103 885
104 884
105 883
106 882
107 881
101 886
122 866
123 ...

result:

wrong answer there are no solutions in your plan