Submission #1313559

#TimeUsernameProblemLanguageResultExecution timeMemory
1313559kawhietArt Class (IOI13_artclass)C++20
1 / 100
29 ms3336 KiB
#include <bits/stdc++.h> #include "artclass.h" using namespace std; mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); int is_4(int n, int m, int r[500][500], int g[500][500], int b[500][500]) { int bad = 0; for (int i = 1; i < n; i++) { int cnt = 1, mx = 1; for (int j = 1; j < m; j++) { int dist_r = abs(r[i][j] - r[i - 1][j]); int dist_g = abs(g[i][j] - g[i - 1][j]); int dist_b = abs(b[i][j] - b[i - 1][j]); if (max({dist_r, dist_b, dist_g}) > 20) { cnt = 1; } else { cnt++; } mx = max(mx, cnt); } if (mx < m / 2) { bad++; } } if (bad >= 50) { return false; } else { return true; } } int is_2(int n, int m, int r[500][500], int g[500][500], int b[500][500]) { int cnt = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int x = r[i][j], y = g[i][j], z = b[i][j]; if (z < min(x, y)) { cnt++; } } } if (cnt * 4 > n * m) { return true; } else { return false; } } int style(int n, int m, int r[500][500], int g[500][500], int b[500][500]) { return 2; }
#Verdict Execution timeMemoryGrader output
Fetching results...