oj.uz

Submission #845548

# Submission time Handle Problem Language Result Execution time Memory
845548 2023-09-06T14:05:12 Z vjudge1 Konstrukcija (COCI20_konstrukcija) C++17
0 / 110
 0 ms 344 KB 
#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
    #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#define int long long
#define pb push_back
#define lim 300000
#define till 40001
// # of primes till 1e6 = 7e4
using namespace std;
using namespace __gnu_pbds;

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
using pii = array<int,2>;

const int mod=1000000007ll;

void solve(){
    int k;
    cin>>k;
    if(!k){
        cout<<"3 2\n1 2\n2 3\n";
    }else if(0<k){
        cout<<k+3<<" "<<k*2<<"\n";
        for(int i=2;i<=k+2;i++){
            cout<<"1 "<<i<<"\n"<<i<<" "<<k+3<<"\n";
        }
    }else{
        cout<<-2*k+2<<" "<<(-k)*2<<"\n";
        for(int i=2;i<=-k+1;i+=2){
            cout<<"1 "<<i<<"\n"<<i<<" "<<i+1<<"\n"<<i+1<<" "<<-2*k+2<<"\n";
        }
    }
}


signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
#ifdef Local  
#ifndef INTERACTIVE
    freopen("in","r",stdin);
#endif
    freopen("out","w",stdout);
#endif
    int t=1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 60.0

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