제출 #845592

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

Main

#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<<"6 6\n1 4\n1 5\n4 3\n5 3\n3 2\n2 6";
    }else if(0<k){
        cout<<k+3<<" "<<(k+1)*2<<"\n";
        for(int i=2;i<=k+2;i++){
            cout<<"1 "<<i<<"\n"<<i<<" "<<k+3<<"\n";
        }
    }else{
        cout<<-2*k+4<<" "<<(-k+1)*3<<"\n";
        for(int i=1;i*2<-2*k+4;i++){
            cout<<"1 "<<i*2<<"\n"<<i*2<<" "<<2*i+1<<"\n"<<2*i+1<<" "<<-2*k+4<<"\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: 15 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 20
• Subtask 4: 0 / 60