oj.uz

Submission #167460

# Submission time Handle Problem Language Result Execution time Memory
167460 2019-12-08T15:29:56 Z PedroBigMan Prosjecni (COCI16_prosjecni) C++14
24 / 120
 3 ms 504 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
#define si signed
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll N; cin>>N;
    vector<vector<ll> > a;
    vector<ll> xx; REP(i,0,N) {xx.pb(0);}
    REP(i,0,N) {a.pb(xx);}
    if(N%2==1)
    {
        REP(i,0,N)
        {
            REP(j,0,N)
            {
                cout<<N*i +j+1<<" ";
            }
            cout<<endl;
        }
    }
    else if(N==2)
    {
        cout<<-1<<endl;
    }
    else
    {
        REP(i,0,N)
        {
            REP(j,0,N)
            {
                ll ans=(3*N*i)/2+j+1;
                if(j==N-1) {ans+=N/2;}
                if(i==N-1) {ans+=(3*N*N)/2;}
                cout<<ans<<" ";
            }
            cout<<endl;
        }
    }
    return 0;
}

Compilation message

prosjecni.cpp: In function 'void Out(std::vector<long long int>)':
prosjecni.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
prosjecni.cpp:20:29:
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                             ~~~~~~~~~~~~
prosjecni.cpp:20:25: note: in expansion of macro 'REP'
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                         ^~~

Subtask #1
24.0 / 120.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Average condition doesn't hold.
2 Correct 2 ms 376 KB Output is correct
3 Incorrect 2 ms 376 KB Average condition doesn't hold.
4 Correct 2 ms 376 KB Output is correct
5 Incorrect 2 ms 376 KB Average condition doesn't hold.
6 Incorrect 3 ms 376 KB Average condition doesn't hold.
7 Incorrect 2 ms 376 KB Average condition doesn't hold.
8 Incorrect 3 ms 504 KB Average condition doesn't hold.
9 Incorrect 3 ms 504 KB Average condition doesn't hold.
10 Incorrect 3 ms 504 KB Average condition doesn't hold.