# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
168913 | 2019-12-17T05:42:48 Z | abil | Gift (IZhO18_nicegift) | C++14 | 1634 ms | 22808 KB |
#include <bits/stdc++.h> #define fr first #define sc second #define pb push_back #define mk make_pair #define all(s) s.begin(),s.end() #define int long long using namespace std; const int N = (1e6 + 12); const int mod = (1e9 + 7); const int INF = (0x3f3f3f3f); int a[N]; main() { int n, k; bool f = true; scanf("%lld%lld", &n, &k); for(int i = 1;i <= n; i++){ scanf("%lld", &a[i]); if(i > 1){ if(a[i] != a[i - 1]){ f = false; } } } if(f){ if(n % k == 0){ cout << n / k << endl; int x = n / k, cnt = 1; while(x--){ cout << a[1] << " "; for(int i = 1;i <= k; i++){ cout << cnt << " "; cnt++; } cout << endl; } } else{ cout << -1; } } else{ cout << -1; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Jury has the answer but participant has not |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Jury has the answer but participant has not |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Jury has the answer but participant has not |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1634 ms | 22808 KB | n=1000000 |
2 | Correct | 787 ms | 13532 KB | n=666666 |
3 | Correct | 324 ms | 7496 KB | n=400000 |
4 | Incorrect | 47 ms | 2552 KB | Jury has the answer but participant has not |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Jury has the answer but participant has not |
2 | Halted | 0 ms | 0 KB | - |