# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
442692 | 2021-07-08T15:33:21 Z | Markomafko972 | Hop (COCI21_hop) | C++14 | 57 ms | 5236 KB |
#include <bits/stdc++.h> using namespace std; int n; long long a[1005]; int kol[1005]; int sol[1005][1005]; vector< pair<int, int> > v; int main () { cin >> n; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { sol[i][j] = 3; } } int z = -1; for (int i = 0; i < n; i++) { cin >> a[i]; int maxi = -1; for (int j = z+1; j < i; j++) { if (a[i] % a[j] == 0) { maxi = max(maxi, kol[j]); } } if (maxi >= 3) { v.push_back({z+1, i-1}); z = i-1; } else { for (int j = z+1; j < i; j++) sol[i][j] = 1; kol[i] = maxi+1; } //cout << i << ": " << kol[i] << endl; } v.push_back({z+1, n-1}); for (int i = 0; i < v.size(); i += 4) { for (int j = 0; j <= 3; j++) { for (int k = j+1; k <= 3; k++) { for (int l = v[i+j].first; l <= v[i+j].second; l++) { for (int m = v[i+k].first; m <= v[i+k].second; m++) { sol[m][l] = 2; } } } } } for (int i = 1; i < n; i++) { for (int j = 0; j < i; j++) { cout << sol[i][j] << " "; } cout << "\n"; } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
4 | Correct | 1 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 1 ms | 332 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
4 | Correct | 1 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 1 ms | 332 KB | Output is correct |
7 | Correct | 1 ms | 460 KB | Output is correct |
8 | Correct | 57 ms | 5236 KB | Output is correct |
9 | Correct | 1 ms | 712 KB | Output is correct |
10 | Correct | 1 ms | 716 KB | Output is correct |
11 | Correct | 45 ms | 4684 KB | Output is correct |
12 | Correct | 57 ms | 5148 KB | Output is correct |
13 | Correct | 47 ms | 4804 KB | Output is correct |
14 | Correct | 3 ms | 1072 KB | Output is correct |
15 | Correct | 46 ms | 4804 KB | Output is correct |
16 | Correct | 47 ms | 4824 KB | Output is correct |
17 | Correct | 54 ms | 4816 KB | Output is correct |
18 | Correct | 47 ms | 4836 KB | Output is correct |
19 | Correct | 47 ms | 4824 KB | Output is correct |
20 | Correct | 48 ms | 4780 KB | Output is correct |
21 | Correct | 51 ms | 4804 KB | Output is correct |
22 | Correct | 48 ms | 4804 KB | Output is correct |
23 | Correct | 55 ms | 5164 KB | Output is correct |