# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
209118 | 2020-03-13T08:49:59 Z | MertD014 | Prosjecni (COCI16_prosjecni) | C++17 | 1000 ms | 376 KB |
#include <bits/stdc++.h> using namespace std; int dp(int w){ if(w==1) return 1; return w+dp(w-1); } int n; int main(){ freopen("all.in","r",stdin); freopen("all.out","w",stdout); cin>>n; if(n==2) cout<<"-1"; else if(n%2){ for(int i=0;i<n;i++){ for(int j=0;j<n;j++) cout<<i*n+j+1<<" "; cout<<endl; } } else{ int g=dp(n-1); int sum=0; int d[n],d2[n]; for(int i=0;i<n-1;i++){d[i]=i+1;} d[n-1]=g; for(int i=0;i<n-1;i++){d2[i]=1+g*i;sum+=d2[i];} int bottomleft=d2[n-2]*n-sum; int diff=g-n+1; for(int i=0;i<n-1;i++){ for(int j=0;j<n;j++){ cout<<d[j]<<" "; d[j]+=g; } cout<<endl; } for(int i=0;i<n-1;i++){ cout<<bottomleft+i<<" "; } cout<<bottomleft+n-2+diff; } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1098 ms | 256 KB | Time limit exceeded |
2 | Execution timed out | 1095 ms | 256 KB | Time limit exceeded |
3 | Execution timed out | 1049 ms | 256 KB | Time limit exceeded |
4 | Execution timed out | 1073 ms | 256 KB | Time limit exceeded |
5 | Execution timed out | 1092 ms | 256 KB | Time limit exceeded |
6 | Execution timed out | 1087 ms | 376 KB | Time limit exceeded |
7 | Execution timed out | 1087 ms | 376 KB | Time limit exceeded |
8 | Execution timed out | 1088 ms | 256 KB | Time limit exceeded |
9 | Execution timed out | 1094 ms | 376 KB | Time limit exceeded |
10 | Execution timed out | 1093 ms | 376 KB | Time limit exceeded |