oj.uz

Submission #166793

# Submission time Handle Problem Language Result Execution time Memory
166793 2019-12-04T06:49:17 Z Atill83 Prosjecni (COCI16_prosjecni) C++14
120 / 120
 3 ms 376 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 1e2+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int grid[MAXN][MAXN];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("../IO/int.txt","r",stdin);
        freopen("../IO/out.txt","w",stdout);
    #endif

    cin>>n;

    if(n % 2){
        for(int i = 0; i < n; i++){
            for(int k = n*i + 1; k <= n*(i + 1); k++){
                cout<<k<<" ";
            }
            cout<<endl;
        }
    }else{
        if(n == 2){
            cout<<-1<<endl;
            return 0;
        }
        int sim = 1;
        for(int i = 0; i < n - 1; i++){
            ll top = 0;
            for(int j = 0; j < n - 1; j++){
                grid[i][j] = sim++;
                top += grid[i][j];
            }
            grid[i][n - 1] = n*grid[i][n - 2] - top;
            sim = grid[i][n - 1] + 1;
        }
        ll top = 0;
        for(int i = 0; i < n - 1; i++){
            top += grid[i][0];
        }
        grid[n - 1][0] = n*grid[n - 2][0] - top;
        top = grid[n - 1][0];
        for(int j = 1; j < n - 1; j++){
            grid[n - 1][j] = grid[n - 1][j - 1] + 1;
            top += grid[n - 1][j];
        }
        grid[n - 1][n - 1] = n*grid[n - 1][n - 2] - top;


        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                cout<<grid[i][j]<<" ";
            }
            cout<<endl;
        }
    }
    

    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
120.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct