Submission #1313727

#TimeUsernameProblemLanguageResultExecution timeMemory
1313727kawhietArt Class (IOI13_artclass)C++20
5 / 100
51 ms6244 KiB
#include <bits/stdc++.h> #include "artclass.h" using namespace std; int n, m; vector<vector<int>> r, g, b; double get(double tot, double cnt) { return 100.0 / tot * cnt; } bool field() { int bad = 0; for (int i = 0; i < n; i++) { int cnt = 1, mx = 1; for (int j = 1; j < m; j++) { int d1 = abs(r[i][j] - r[i][j - 1]); int d2 = abs(g[i][j] - g[i][j - 1]); int d3 = abs(b[i][j] - b[i][j - 1]); if (max({d1, d2, d3}) > 20) { cnt = 1; } else { cnt++; } mx = max(mx, cnt); } if (get(m, mx) < 50) { i += 5; bad++; } } cerr << bad << '\n'; return bad <= 40; } bool action() { return false; } bool landscape() { return false; } bool modern() { return false; } int style(int _n, int _m, int _r[500][500], int _g[500][500], int _b[500][500]) { n = _n; m = _m; r.assign(n, vector<int>(m, 0)); b.assign(n, vector<int>(m, 0)); g.assign(n, vector<int>(m, 0)); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { r[i][j] = _r[i][j]; g[i][j] = _g[i][j]; b[i][j] = _b[i][j]; } } if (field()) return 4; return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...