oj.uz

Submission #845635

# Submission time Handle Problem Language Result Execution time Memory
845635 2023-09-06T14:36:04 Z vjudge1 Konstrukcija (COCI20_konstrukcija) C++17
0 / 110
 2 ms 2648 KB 
#include <bits/stdc++.h>
#define fast cin.tie(0)->sync_with_stdio(0);
#define int long long
#define inf ((int)1e18)
#define N 100005
using namespace std;
bool vis[N];
int way[N];
vector <vector<int> > adj(N);

int32_t main(){
	fast
	int k;
	cin>>k;
	if(k <= 0) {
		cout<<2<<" "<<0<<"\n";
		return 0;
	}
	if(k < 0) {
		
	}
	else {
		cout<<k + 2<<" "<<k * 2<<"\n";
		for(int i = 0; i < k; i++) {
			cout<<1<<" "<<i + 2<<"\n";
		}
		for(int i = 0; i < k; i++) {
			cout<<i + 2<<" "<<k + 2<<"\n";
		}
	}
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2648 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2648 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2648 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2648 KB Wrong answer.
2 Halted 0 ms 0 KB -