Submission #1313628

#TimeUsernameProblemLanguageResultExecution timeMemory
1313628kawhietArt Class (IOI13_artclass)C++20
17 / 100
36 ms3340 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 >= 80) { 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) && y + 20 >= max(x, z)) { cnt++; } } } // cerr << 100.0 / double(n * m) * double(cnt) << '\n'; // cerr << cnt * 4 << ' ' << n * m * 10 << '\n'; if (cnt * 10 > n * m * 3) { return true; } else { return false; } } int style(int n, int m, int r[500][500], int g[500][500], int b[500][500]) { if (is_4(n, m, r, g, b)) return 4; if (is_2(n, m, r, g, b)) return 2; return 3; // return -1; // return (rng() % 2) * 2 + 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...