QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#71416	#5255. Greedy Drawers	Sorting^#	AC ✓	2ms	3548kb	C++	756b	2023-01-09 22:59:51	2023-03-17 01:51:22

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:22]
评测

测评结果：AC
用时：2ms
内存：3548kb

查看

[2023-01-09 22:59:51]
提交

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<30 ;i++){
		int iu=n/30+(i<n%30);
		int cx=3*i;
		int cy=3*(29-i);
		v1.push_back({cx+1,cy+2});
		for(int j=1; j<=iu-2  ;j++) v1.push_back({cx+2,cy+2});
		for(int j=1; j<=iu-2  ;j++) v2.push_back({cx+2,cy+3});
		v2.push_back({cx+3,cy+3});
		v1.push_back({cx+3,cy+1});
		v2.push_back({cx+4,cy+1});
	}
	//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';
}

Source code, Language: C++

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 2ms

memory: 3340kb

input:

output:

result:

ok you killed Janko's strategy

Test #2:

score: 0

Accepted

time: 2ms

memory: 3424kb

input:

output:

result:

ok you killed Janko's strategy

Test #3:

score: 0

Accepted

time: 2ms

memory: 3320kb

input:

output:

result:

ok you killed Janko's strategy

Test #4:

score: 0

Accepted

time: 2ms

memory: 3372kb

input:

output:

result:

ok you killed Janko's strategy

Test #5:

score: 0

Accepted

time: 1ms

memory: 3340kb

input:

output:

result:

ok you killed Janko's strategy

Test #6:

score: 0

Accepted

time: 1ms

memory: 3376kb

input:

output:

result:

ok you killed Janko's strategy

Test #7:

score: 0

Accepted

time: 2ms

memory: 3548kb

input:

output:

result:

ok you killed Janko's strategy

Test #8:

score: 0

Accepted

time: 2ms

memory: 3348kb

input:

output:

result:

ok you killed Janko's strategy

Test #9:

score: 0

Accepted

time: 2ms

memory: 3472kb

input:

output:

result:

ok you killed Janko's strategy

Test #10:

score: 0

Accepted

time: 0ms

memory: 3376kb

input:

output:

result:

ok you killed Janko's strategy

Test #11:

score: 0

Accepted

time: 2ms

memory: 3372kb

input:

output:

result:

ok you killed Janko's strategy

Test #12:

score: 0

Accepted

time: 2ms

memory: 3348kb

input:

output:

result:

ok you killed Janko's strategy

Test #13:

score: 0

Accepted

time: 2ms

memory: 3544kb

input:

output:

result:

ok you killed Janko's strategy

Test #14:

score: 0

Accepted

time: 2ms

memory: 3420kb

input:

output:

result:

ok you killed Janko's strategy

Test #15:

score: 0

Accepted

time: 2ms

memory: 3420kb

input:

output:

result:

ok you killed Janko's strategy

Test #16:

score: 0

Accepted

time: 1ms

memory: 3420kb

input:

output:

result:

ok you killed Janko's strategy

Test #17:

score: 0

Accepted

time: 2ms

memory: 3420kb

input:

output:

result:

ok you killed Janko's strategy

Test #18:

score: 0

Accepted

time: 0ms

memory: 3348kb

input:

output:

result:

ok you killed Janko's strategy

Test #19:

score: 0

Accepted

time: 2ms

memory: 3316kb

input:

output:

result:

ok you killed Janko's strategy

Test #20:

score: 0

Accepted

time: 2ms

memory: 3432kb

input:

output:

result:

ok you killed Janko's strategy