제출 #59567

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
59567		Benq	Prosjecni (COCI16_prosjecni)	C++11	120 / 120	4 ms	672 KiB

prosjecni

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int n;
vi v;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    if (n % 2 == 1) {
        FOR(i,1,n+1) v.pb(i);
    } else {
        if (n == 2) {
            cout << -1;
            exit(0);
        }
        v.pb(1);
        int d = (n-1)/2;
        FOR(i,-d,d+1) v.pb(n+1+i);
    }
    // for (int i: v) cout << i << " ";
    F0R(i,sz(v)) {
        F0R(j,sz(v)) cout << v[i]*1000+v[j] << " ";
        cout << "\n";
    }
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

• Subtask 1: 120 / 120