oj.uz

답안 #845502

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
845502 2023-09-06T13:54:55 Z vjudge1 Konstrukcija (COCI20_konstrukcija) C++14
15 / 110
 2 ms 348 KB 
// Aber der schlimmste Fiend, dem du begegnen kannst, wirst du immer dir selber sein
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define rev reverse
#define all(x) x.begin(),x.end()
#define acc accumulate
#define sz size()
#define MOD 1000000007
#define rall(x) x.rbegin(),x.rend()
#define rep(i, x, n) for(int i = x; i < n; i++)
using namespace std;
const int N = 2e5 + 5;
inline void solve(){
    int n;
    cin >> n;
    n++;
    if( n >= 1){
        cout << n+2 << " " << 2 * n << endl;
        for(int i = 2; i < n+2; i++){
            cout << 1 << " " << i << endl;
            cout << i << " " << n+2 << endl;
        }
    }
}   
int main(){
    fast_io
    int t;
    t = 1;
    while(t--) solve();
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct.
2 Correct 0 ms 348 KB Correct.
3 Correct 1 ms 348 KB Correct.
4 Correct 0 ms 348 KB Correct.
5 Correct 2 ms 348 KB Correct.

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct.
2 Correct 0 ms 348 KB Correct.
3 Correct 1 ms 348 KB Correct.
4 Correct 0 ms 348 KB Correct.
5 Correct 2 ms 348 KB Correct.
6 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
7 Halted 0 ms 0 KB -

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Correct.
2 Correct 0 ms 348 KB Correct.
3 Correct 1 ms 348 KB Correct.
4 Correct 0 ms 348 KB Correct.
5 Correct 2 ms 348 KB Correct.
6 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
7 Halted 0 ms 0 KB -