oj.uz

답안 #845588

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
845588 2023-09-06T14:20:04 Z vjudge1 Konstrukcija (COCI20_konstrukcija) C++17
15 / 110
 0 ms 348 KB 
#include <bits/stdc++.h>
#pragma optimize "DostSeferoğlu"
#pragma GCC optimize("unroll-loops,Ofast")
#pragma GCC target("avx2,tune=native")
using namespace std;
#define int long long
#define pii pair<int,int>
#define bg begin
#define vi vector<int>
#define endl '\n'
#define vvi vector<vi> 
#define pc __builtin_popcountll
#define vp vector<pii>
#define sp << " " << 
#define all(x) x.bg()+1,x.end()
#define ff first
#define ss second
#define brake {cout << "OK\n";return;}
#define debug(x) {cout << #x << ": "; for (auto it : x) cout << it << " ";cout << endl;}
#define FF(xxx,sss,yyy) for (int xxx=sss;xxx<=yyy;++xxx)
#define F(xx,yy) for (int xx=1;xx<=yy;++xx)
#define pb push_back 
const int inf = 1e18;
const int MOD = 1e9+7;   
const int N = 2e5+1;
const int A = 2131924;
const int B = 3215515;
const int C = 1631662;
int add(int x,int y) {
    return ((x%MOD)+(y%MOD))%MOD;
}
int mult(int x,int y) {
    return ((x%MOD)*(y%MOD))%MOD;
}
int hsha(string& s,int l,int r) {
    int ret = 0;
    for (int k=l;k<=r;k++) {
        ret = add(mult(ret,A),s[k-1]);
    }
    return ret;
}
int hshb(string& s,int l,int r) {
    int ret = 0;
    for (int k=l;k<=r;k++) {
        ret = add(mult(ret,B),s[k-1]);
    }
    return ret;
}
int hshc(string& s,int l,int r) {
    int ret = 0;
    for (int k=l;k<=r;k++) {
        ret = add(mult(ret,C),s[k-1]);
    }
    return ret;
}
void solve() {
    int k;
    cin >> k;
    if (1<= k && k<500) {
        cout << k+3 sp 2*k+2 << endl;
        for (int i=2;i<=k+2;i++) {
            cout << 1 sp i << endl;
        }
        for (int i=2;i<=k+2;i++) {
            cout << i sp k+3 << endl;
        }
        return;
    }
    if (k <= 1 && k > -300) {
        ;
    }
}    



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

Compilation message

konstrukcija.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize "DostSeferoğlu"
      |

Subtask #1
15.0 / 15.0

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