oj.uz

답안 #88252

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
88252 2018-12-04T21:40:08 Z jasony123123 Prosjecni (COCI16_prosjecni) C++11
120 / 120
 3 ms 796 KB 
#define _CRT_SECURE_NO_WARNINGS
#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;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll PRIME = 105943LL;
const ll INF = 1e18;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**************************COCI 2016-2017 Contest 2 Problem 4 *************************/


int N, A[100][100];

void solveOdd() {
	int cnt = 1;
	FOR(i, 0, N) FOR(j, 0, N)
		A[i][j] = cnt++;
}
void solveEven() {
	int cnt = 1;
	FOR(i, 0, N) {
		FOR(j, 0, N - 1)
			A[i][j] = cnt++;
		cnt += N / 2;
		A[i][N - 1] = cnt++;
	}
	int diff = A[1][0] - A[0][0];
	FOR(j, 0, N)
		A[N - 1][j] += diff*(N / 2);
}
void printArray() {
	FOR(i, 0, N) FOR(j, 0, N)
		cout << A[i][j] << (j == N - 1 ? "\n" : " ");
}
int main() {
	io();
	cin >> N;
	if (N == 2) {
		cout << "-1\n";
		return 0;
	}
	if (N % 2 == 1)
		solveOdd();
	else
		solveEven();
	printArray();
	return 0;
}
/*
...
*/

Subtask #1
120.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 2 ms 628 KB Output is correct
7 Correct 3 ms 720 KB Output is correct
8 Correct 3 ms 796 KB Output is correct
9 Correct 3 ms 796 KB Output is correct
10 Correct 3 ms 796 KB Output is correct