oj.uz

Submission #399082

# Submission time Handle Problem Language Result Execution time Memory
399082 2021-05-05T09:30:17 Z ACmachine Art Class (IOI13_artclass) C++17
34 / 100
 90 ms 12044 KB 
#include "artclass.h"
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }

// make functions return [0..1]
int style(int h, int w, int R[500][500], int G[500][500], int B[500][500]) {
    auto in_tolerance = [&](int a, int b){
        return abs(a - b) < 15;
    };
    auto similar = [&](array<int, 3> a, array<int, 3> b){
        return in_tolerance(a[0],b[0]) && in_tolerance(a[1], b[1]) && in_tolerance(a[2], b[2]);
    };
    vector<vector<array<int, 3>>> grid(500, vector<array<int,3>>(500));
    REP(i, h){
        REP(j, w){
            grid[i][j] = {R[i][j], G[i][j], B[i][j]};
        }
    }
    auto get_green = [&]()->double{
        auto is_green = [&](array<int, 3> px)->double{ // high red and green?
            return (px[0] > 125 && px[1] > 125 && px[2] < 100 ? 1 : 0);
        };
        double cnt = 0;
        REP(i, h){
            REP(j, w){
                cnt += is_green(grid[i][j]);
            }
        }
        return (double)cnt / (double)(h * w);
    };
    auto get_granularity = [&]()->double{
        double res = 0;
        REP(i, h){
            REP(j, w){
                double curr = 0;
                REP(sm, 4){
                    if(dy[sm] < 0 || dx[sm] < 0) continue;
                    int ny = i + dy[sm];
                    int nx = j + dx[sm];
                    if(ny < 0 || ny >= h || nx < 0 || nx >= w) continue;
                    if(!similar(grid[i][j], grid[ny][nx]))
                        curr+=1.0;
                }
                res += curr;
            }
        }
        return res / (double)(h * w * 2);
    };
    auto similar2 = [&](array<int, 3> a, array<int, 3> b){
        int cutoff = 40;
        return abs(a[0] - b[0]) < cutoff && abs(a[1] - b[1]) < cutoff && abs(a[2] - b[2]) < cutoff;
    };
    auto get_components = [&]()->array<double, 2>{ // also count disproportionate components
        vector<vector<int>> visited(h, vector<int>(w, -1));
        int curr_id = 0;
        auto bfs = [&](int row, int col){
            queue<array<int, 2>> q;
            visited[row][col] = curr_id;
            q.push({row, col});
            while(!q.empty()){
                auto v = q.front();
                q.pop();
                REP(sm, 4){
                    int ny = v[0] + dy[sm];
                    int nx = v[1] + dx[sm];
                    if(ny < 0 || ny >= h || nx < 0 || nx >= w || visited[ny][nx] != -1 || !similar2(grid[ny][nx], grid[row][col]))
                        continue;
                    visited[ny][nx] = curr_id;
                    q.push({ny, nx});
                }
            }
        };
        vector<int> miny(h * w, INF);
        vector<int> maxy(h * w, -INF);
        vector<int> minx(h * w, INF);
        vector<int> maxx(h * w, -INF);
        vector<int> cnt(h * w, 0);
        REP(i, h){
            REP(j, w){
                if(visited[i][j] == -1){
                    bfs(i, j);
                    curr_id++;
                }
            }
        }
        REP(i, h){
            REP(j, w){
                miny[visited[i][j]] = min(miny[visited[i][j]], i);
                maxy[visited[i][j]] = max(maxy[visited[i][j]], i);
                minx[visited[i][j]] = min(minx[visited[i][j]], j);
                maxx[visited[i][j]] = max(maxx[visited[i][j]], j);
                cnt[visited[i][j]]++;
            }
        }
        int components = 0; // only 30+ px; ?
        int disproportionate_components = 0;
        REP(i, h * w){
            if(cnt[i] > 10){
                components++;
                int s = abs(miny[i] - maxy[i]) * abs(minx[i] - maxx[i]);
                double cut = 0.3;
                if((double)cnt[i] / s < cut)
                    disproportionate_components++;
            }
        }
        return {(1.0 * components) / (1.0 * h * w), 1.0 * disproportionate_components};
    };
    double p = get_green();
    double p2 = get_granularity();
    auto v3 = get_components();
    //dbg(v3);
    if(p2 > 0.25){
        // 2 or 3; big granularity
        return (rand()%2 == 0 ? 2 : 3);
    }
    else{
        // 1 or 4
        if(v3[0] < 0.001){
            return 4;
        }
        else{
            return 1;
        }

    }


    return 2;
}

Compilation message

artclass.cpp: In function 'int style(int, int, int (*)[500], int (*)[500], int (*)[500])':
artclass.cpp:161:12: warning: unused variable 'p' [-Wunused-variable]
  161 |     double p = get_green();
      |            ^

Subtask #1
34.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 77 ms 10292 KB Output isn't correct
2 Correct 59 ms 8572 KB Output is correct
3 Incorrect 83 ms 11836 KB Output isn't correct
4 Incorrect 75 ms 10548 KB Output isn't correct
5 Correct 74 ms 11160 KB Output is correct
6 Correct 77 ms 11496 KB Output is correct
7 Incorrect 72 ms 10540 KB Output isn't correct
8 Incorrect 74 ms 10312 KB Output isn't correct
9 Correct 57 ms 9568 KB Output is correct
10 Correct 66 ms 10904 KB Output is correct
11 Correct 66 ms 10136 KB Output is correct
12 Correct 72 ms 11332 KB Output is correct
13 Correct 50 ms 7756 KB Output is correct
14 Incorrect 75 ms 10676 KB Output isn't correct
15 Incorrect 70 ms 10972 KB Output isn't correct
16 Incorrect 82 ms 11824 KB Output isn't correct
17 Incorrect 68 ms 10992 KB Output isn't correct
18 Correct 78 ms 10948 KB Output is correct
19 Incorrect 47 ms 8004 KB Output isn't correct
20 Correct 83 ms 12028 KB Output is correct
21 Incorrect 68 ms 10272 KB Output isn't correct
22 Incorrect 66 ms 10672 KB Output isn't correct
23 Correct 75 ms 10692 KB Output is correct
24 Correct 59 ms 10092 KB Output is correct
25 Correct 54 ms 9840 KB Output is correct
26 Incorrect 66 ms 10052 KB Output isn't correct
27 Incorrect 84 ms 12028 KB Output isn't correct
28 Correct 21 ms 4940 KB Output is correct
29 Correct 86 ms 11888 KB Output is correct
30 Correct 71 ms 11092 KB Output is correct
31 Correct 76 ms 9772 KB Output is correct
32 Correct 24 ms 7500 KB Output is correct
33 Correct 81 ms 11716 KB Output is correct
34 Correct 41 ms 9028 KB Output is correct
35 Correct 60 ms 8788 KB Output is correct
36 Incorrect 76 ms 10740 KB Output isn't correct
37 Correct 40 ms 6724 KB Output is correct
38 Correct 66 ms 10916 KB Output is correct
39 Correct 40 ms 6724 KB Output is correct
40 Correct 78 ms 10708 KB Output is correct
41 Correct 70 ms 11192 KB Output is correct
42 Incorrect 72 ms 10012 KB Output isn't correct
43 Correct 69 ms 10304 KB Output is correct
44 Incorrect 75 ms 10564 KB Output isn't correct
45 Correct 68 ms 9672 KB Output is correct
46 Correct 78 ms 11536 KB Output is correct
47 Correct 56 ms 9792 KB Output is correct
48 Correct 57 ms 10088 KB Output is correct
49 Correct 88 ms 11972 KB Output is correct
50 Correct 77 ms 11672 KB Output is correct
51 Correct 54 ms 9864 KB Output is correct
52 Incorrect 69 ms 9796 KB Output isn't correct
53 Incorrect 71 ms 10100 KB Output isn't correct
54 Incorrect 78 ms 10988 KB Output isn't correct
55 Correct 84 ms 11972 KB Output is correct
56 Correct 78 ms 11036 KB Output is correct
57 Incorrect 83 ms 11948 KB Output isn't correct
58 Correct 64 ms 10324 KB Output is correct
59 Correct 63 ms 9068 KB Output is correct
60 Incorrect 73 ms 10032 KB Output isn't correct
61 Correct 75 ms 10556 KB Output is correct
62 Correct 57 ms 9904 KB Output is correct
63 Correct 79 ms 11468 KB Output is correct
64 Correct 68 ms 10884 KB Output is correct
65 Correct 58 ms 10232 KB Output is correct
66 Incorrect 55 ms 9796 KB Output isn't correct
67 Correct 61 ms 9728 KB Output is correct
68 Incorrect 74 ms 10404 KB Output isn't correct
69 Incorrect 90 ms 12044 KB Output isn't correct
70 Incorrect 77 ms 10772 KB Output isn't correct
71 Incorrect 55 ms 8900 KB Output isn't correct
72 Correct 53 ms 7736 KB Output is correct
73 Incorrect 74 ms 10920 KB Output isn't correct
74 Correct 49 ms 9560 KB Output is correct
75 Incorrect 65 ms 9924 KB Output isn't correct
76 Correct 81 ms 10740 KB Output is correct
77 Correct 73 ms 11252 KB Output is correct
78 Correct 69 ms 10944 KB Output is correct
79 Correct 82 ms 11964 KB Output is correct
80 Incorrect 71 ms 10436 KB Output isn't correct
81 Incorrect 85 ms 12020 KB Output isn't correct
82 Correct 71 ms 11232 KB Output is correct
83 Correct 67 ms 9680 KB Output is correct
84 Correct 82 ms 11000 KB Output is correct
85 Correct 73 ms 10060 KB Output is correct
86 Correct 53 ms 9276 KB Output is correct
87 Correct 43 ms 6928 KB Output is correct
88 Incorrect 67 ms 10044 KB Output isn't correct
89 Correct 64 ms 10840 KB Output is correct
90 Incorrect 67 ms 10876 KB Output isn't correct
91 Correct 49 ms 7620 KB Output is correct
92 Incorrect 69 ms 10868 KB Output isn't correct
93 Incorrect 48 ms 7680 KB Output isn't correct
94 Correct 77 ms 10336 KB Output is correct
95 Incorrect 74 ms 10948 KB Output isn't correct
96 Correct 76 ms 10652 KB Output is correct
97 Incorrect 73 ms 11024 KB Output isn't correct
98 Correct 83 ms 11972 KB Output is correct
99 Correct 59 ms 8644 KB Output is correct
100 Incorrect 88 ms 11024 KB Output isn't correct
101 Incorrect 62 ms 10248 KB Output isn't correct
102 Incorrect 83 ms 11972 KB Output isn't correct