QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#138735	#5255. Greedy Drawers	UNos_maricones^#	AC ✓	1ms	3888kb	C++20	1.1kb	2023-08-12 09:14:43	2023-08-12 09:14:53

Judging History

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

[2023-08-12 09:14:53]
评测

测评结果：AC
用时：1ms
内存：3888kb

查看

[2023-08-12 09:14:43]
提交

answer

#include <bits/stdc++.h>
using namespace std;

#define ff   first
#define ss   second
#define pb   push_back

typedef long long   ll;
typedef pair<int,int>   pii;

const int N = 3e5+5;
const int mod = 1e9+7;

int n;
vector <pii> est, lib;

int itX = 1000, itY = 1;

void createGroup () {
	est.pb ( {itX, itY} );
	est.pb ( {itX, itY} );
	est.pb ( {itX, itY} );
	lib.pb ( {itX, itY} );
	lib.pb ( {itX, itY} );
	itX--;
	lib.pb ( {itX, itY} );
	itY++;
	est.pb ( {itX, itY} );
	itX--;
	lib.pb ( {itX, itY} );
	itY++;
	est.pb ( {itX, itY} );
	est.pb ( {itX, itY} );
	est.pb ( {itX, itY} );
	lib.pb ( {itX, itY} );
	lib.pb ( {itX, itY} );
	lib.pb ( {itX, itY} );
}

int main() { 
	#ifdef LOCAL
	freopen("in.txt","r",stdin);
	#endif
	
	scanf ( "%d", &n );
	
	for ( int i = 0; i < n/7; ++i ) {
		createGroup ();
		itX--, itY++;
	}
	
	for ( int i = 0; i < n%7; ++i ) {
		est.pb ( {itX, itY} );
		lib.pb ( {itX, itY} );
	}
	
	for ( pii it: lib ) {
		printf ( "%d %d\n", it.ff, it.ss ); 
	}
	printf ( "\n" );
	for ( pii it: est ) {
		printf ( "%d %d\n", it.ff, it.ss ); 
	}
	
	return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3660kb

input:

output:

result:

ok you killed Janko's strategy

Test #2:

score: 0

Accepted

time: 1ms

memory: 3652kb

input:

output:

result:

ok you killed Janko's strategy

Test #3:

score: 0

Accepted

time: 1ms

memory: 3740kb

input:

output:

result:

ok you killed Janko's strategy

Test #4:

score: 0

Accepted

time: 1ms

memory: 3888kb

input:

output:

result:

ok you killed Janko's strategy

Test #5:

score: 0

Accepted

time: 1ms

memory: 3604kb

input:

output:

result:

ok you killed Janko's strategy

Test #6:

score: 0

Accepted

time: 1ms

memory: 3712kb

input:

output:

result:

ok you killed Janko's strategy

Test #7:

score: 0

Accepted

time: 1ms

memory: 3672kb

input:

output:

result:

ok you killed Janko's strategy

Test #8:

score: 0

Accepted

time: 1ms

memory: 3744kb

input:

output:

result:

ok you killed Janko's strategy

Test #9:

score: 0

Accepted

time: 1ms

memory: 3848kb

input:

output:

result:

ok you killed Janko's strategy

Test #10:

score: 0

Accepted

time: 1ms

memory: 3888kb

input:

output:

result:

ok you killed Janko's strategy

Test #11:

score: 0

Accepted

time: 1ms

memory: 3676kb

input:

output:

result:

ok you killed Janko's strategy

Test #12:

score: 0

Accepted

time: 0ms

memory: 3868kb

input:

output:

result:

ok you killed Janko's strategy

Test #13:

score: 0

Accepted

time: 1ms

memory: 3624kb

input:

output:

result:

ok you killed Janko's strategy

Test #14:

score: 0

Accepted

time: 1ms

memory: 3660kb

input:

output:

result:

ok you killed Janko's strategy

Test #15:

score: 0

Accepted

time: 1ms

memory: 3848kb

input:

output:

result:

ok you killed Janko's strategy

Test #16:

score: 0

Accepted

time: 1ms

memory: 3648kb

input:

output:

result:

ok you killed Janko's strategy

Test #17:

score: 0

Accepted

time: 0ms

memory: 3844kb

input:

output:

result:

ok you killed Janko's strategy

Test #18:

score: 0

Accepted

time: 1ms

memory: 3748kb

input:

output:

result:

ok you killed Janko's strategy

Test #19:

score: 0

Accepted

time: 1ms

memory: 3880kb

input:

output:

result:

ok you killed Janko's strategy

Test #20:

score: 0

Accepted

time: 1ms

memory: 3676kb

input:

output:

result:

ok you killed Janko's strategy