제출 #988099

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
988099		vjudge1	Konstrukcija (COCI20_konstrukcija)	C++17	30 / 110	1 ms	348 KiB

Main

#include <bits/stdc++.h>
using namespace std;
 
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
 
const int INF = 2147483645;
const ll NINF = 1e10;
const int maxN = (int)1e5+5;
const ll LLINF = LLONG_MAX;
//const ll mod = 998244353;
const ll mod = 1000000007;

void solv() {
	ll k;
	cin>>k;
	if (abs(k) > 1000) {
		cout<<1<<" "<<0<<'\n';
		return;
	}
	if (k < 0) {
		k *= -1;
		cout<<k+5<<" "<<((k+1)*3)+2<<'\n';
		cout<<1<<" "<<2<<"\n"<<1<<" "<<3<<'\n';
		for (int i=4;i<=k+4;i++) {
			cout<<2<<" "<<i<<'\n';
			cout<<3<<" "<<i<<"\n";
			cout<<i<<" "<<k+5<<'\n';
		}
		return;
	}
	cout<<k+3<<" "<<(k+1)*2<<'\n';
	for (int i=2;i<=k+2;i++) cout<<1<<" "<<i<<'\n'<<i<<" "<<k+3<<'\n';
}
 
int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int t=1;
//    cin>>t;
    while (t--) solv();
}

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 0 / 20
• Subtask 4: 0 / 60