oj.uz

Submission #240257

# Submission time Handle Problem Language Result Execution time Memory
240257 2020-06-19T03:52:04 Z StevenN Art Class (IOI13_artclass) C++14
0 / 100
 178 ms 13536 KB 
#include "artclass.h"
#include <bits/stdc++.h>
#define isg(a, b) ((G[a][b] - R[a][b] > tolG && G[a][b] - B[a][b] > tolG))
#define pii pair<int, int>
using namespace std;

const int tolG = 20;
const int tol = 20;

int N, M;
int R[505][505];
int G[505][505];
int B[505][505];
set<long long> ada; 
int green, white, big_green;
int baru, cnt_diff, beda;
double avg_diff;//avg diff of color under tol
double avg_pos_white;//avg ketinggian putih

bool ijo(int a, int b) {
    return ((G[a][b] - R[a][b] > tolG && G[a][b] - B[a][b] > tolG));
}

bool putih(int a, int b) {
    int mx = max(G[a][b], max(R[a][b], B[a][b]));
    int mn = min(G[a][b], min(R[a][b], B[a][b]));
    return mx - mn <= 5;
}

int perbedaan(int a, int b, int c, int d) {
    return abs(R[a][b] - R[c][d]) + abs(B[a][b] - B[c][d]) + abs(G[a][b] - G[c][d]);
}

int vis[505][505];
pii par[505][505];
int sz[505][505];

pii findpar(pii u) {
  return par[u.first][u.second] == u ? u : par[u.first][u.second] = findpar(par[u.first][u.second]);
}

void merge(int a, int b, int p, int q) {
  pii u = {a, b}, v = {p, q};
  u = findpar(u), v = findpar(v);
  if(v == u) return;
//  cout << a << " " << b << " - " << p << " " << q << "\n";
  par[v.first][v.second] = u;
}

void go(int r, int c) {
    if(r > 1) {
        int tmp = perbedaan(r, c, r - 1, c);
        if(tmp <= tol) {
            avg_diff += beda;
            cnt_diff++;
            merge(r, c, r - 1, c);
        }
    }
    if(r < N) {
        int tmp = perbedaan(r, c, r + 1, c);
        if(tmp <= tol) {
            avg_diff += beda;
            cnt_diff++;
            merge(r, c, r + 1, c);
        }
    }
    if(c > 1) {
        int tmp = perbedaan(r, c, r, c - 1);
        if(tmp <= tol) {
            avg_diff += beda;
            cnt_diff++;
            merge(r, c, r, c - 1);
        }
    }
    if(c < N) {
        int tmp = perbedaan(r, c, r, c + 1);
        if(tmp <= tol) {
            avg_diff += beda;
            cnt_diff++;
            merge(r, c, r, c + 1);
        }
    }
}

int style(int H, int W, int r[500][500], int g[500][500], int b[500][500]) {
    N = H, M = W;
    for(int i = 1; i <= H; i++) {
        for(int j = 1; j <= W; j++) {
            R[i][j] = r[i - 1][j - 1];
            G[i][j] = g[i - 1][j - 1];
            B[i][j] = b[i - 1][j - 1];
        }
    }
    for(int i = 1; i <= H; i++) {
        for(int j = 1; j <= W; j++) {
            green += ijo(i, j);
            if(putih(i, j)) {
                avg_pos_white += i;
                white++;
            }
            long long skrg = 1000000000 * R[i][j] + 1000 * G[i][j] + B[i][j];
            if(ada.count(skrg)) beda++;
            else ada.insert(skrg);
            go(i, j);
        }
    }
    avg_diff /= cnt_diff;
  	return 1;
    if(avg_diff <= 1.0) {
        //petak2
        return 1;
    }
    if(avg_diff <= 5.0) {
        return 4;
    }
    if(green > H * W / 4) {
        return 2;
    } 
    return 3;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 134 ms 10616 KB Output isn't correct
2 Incorrect 138 ms 10488 KB Output isn't correct
3 Incorrect 95 ms 8568 KB Output isn't correct
4 Correct 111 ms 9208 KB Output is correct
5 Incorrect 102 ms 9080 KB Output isn't correct
6 Incorrect 77 ms 6392 KB Output isn't correct
7 Incorrect 85 ms 9208 KB Output isn't correct
8 Correct 106 ms 8184 KB Output is correct
9 Incorrect 112 ms 9848 KB Output isn't correct
10 Incorrect 106 ms 8440 KB Output isn't correct
11 Incorrect 123 ms 11000 KB Output isn't correct
12 Correct 121 ms 8824 KB Output is correct
13 Incorrect 104 ms 8824 KB Output isn't correct
14 Incorrect 128 ms 12280 KB Output isn't correct
15 Correct 99 ms 9208 KB Output is correct
16 Correct 80 ms 9080 KB Output is correct
17 Incorrect 131 ms 10104 KB Output isn't correct
18 Incorrect 140 ms 13048 KB Output isn't correct
19 Incorrect 87 ms 8956 KB Output isn't correct
20 Incorrect 114 ms 8824 KB Output isn't correct
21 Incorrect 85 ms 7136 KB Output isn't correct
22 Incorrect 147 ms 11768 KB Output isn't correct
23 Incorrect 140 ms 11000 KB Output isn't correct
24 Incorrect 139 ms 11640 KB Output isn't correct
25 Incorrect 122 ms 9720 KB Output isn't correct
26 Correct 121 ms 8952 KB Output is correct
27 Incorrect 137 ms 13176 KB Output isn't correct
28 Correct 119 ms 8952 KB Output is correct
29 Incorrect 87 ms 9720 KB Output isn't correct
30 Correct 116 ms 8824 KB Output is correct
31 Incorrect 113 ms 10116 KB Output isn't correct
32 Incorrect 102 ms 11768 KB Output isn't correct
33 Incorrect 138 ms 11384 KB Output isn't correct
34 Incorrect 139 ms 11512 KB Output isn't correct
35 Incorrect 118 ms 10232 KB Output isn't correct
36 Incorrect 93 ms 9212 KB Output isn't correct
37 Incorrect 143 ms 12920 KB Output isn't correct
38 Incorrect 107 ms 9720 KB Output isn't correct
39 Correct 127 ms 9720 KB Output is correct
40 Incorrect 88 ms 7032 KB Output isn't correct
41 Correct 152 ms 11384 KB Output is correct
42 Incorrect 109 ms 8188 KB Output isn't correct
43 Incorrect 97 ms 8544 KB Output isn't correct
44 Incorrect 110 ms 8056 KB Output isn't correct
45 Correct 141 ms 10872 KB Output is correct
46 Incorrect 178 ms 13536 KB Output isn't correct
47 Incorrect 94 ms 8816 KB Output isn't correct
48 Incorrect 125 ms 9464 KB Output isn't correct
49 Incorrect 138 ms 11384 KB Output isn't correct
50 Incorrect 34 ms 3200 KB Output isn't correct
51 Correct 112 ms 9720 KB Output is correct
52 Incorrect 118 ms 9208 KB Output isn't correct
53 Incorrect 127 ms 10300 KB Output isn't correct
54 Incorrect 89 ms 9168 KB Output isn't correct
55 Correct 125 ms 8952 KB Output is correct
56 Incorrect 68 ms 5752 KB Output isn't correct
57 Incorrect 109 ms 9604 KB Output isn't correct
58 Incorrect 68 ms 9464 KB Output isn't correct
59 Correct 135 ms 10232 KB Output is correct
60 Incorrect 129 ms 11684 KB Output isn't correct
61 Incorrect 78 ms 6948 KB Output isn't correct
62 Correct 127 ms 10360 KB Output is correct
63 Correct 78 ms 9080 KB Output is correct
64 Correct 100 ms 9080 KB Output is correct
65 Incorrect 151 ms 13176 KB Output isn't correct
66 Incorrect 144 ms 11688 KB Output isn't correct
67 Incorrect 109 ms 8568 KB Output isn't correct
68 Incorrect 102 ms 8440 KB Output isn't correct
69 Incorrect 135 ms 10488 KB Output isn't correct
70 Incorrect 147 ms 13048 KB Output isn't correct
71 Incorrect 84 ms 9464 KB Output isn't correct
72 Incorrect 112 ms 9044 KB Output isn't correct
73 Incorrect 94 ms 7672 KB Output isn't correct
74 Incorrect 141 ms 11640 KB Output isn't correct
75 Incorrect 139 ms 11512 KB Output isn't correct
76 Incorrect 84 ms 7416 KB Output isn't correct
77 Correct 121 ms 9456 KB Output is correct
78 Incorrect 113 ms 11768 KB Output isn't correct
79 Incorrect 110 ms 10232 KB Output isn't correct
80 Incorrect 115 ms 8828 KB Output isn't correct
81 Incorrect 111 ms 9336 KB Output isn't correct
82 Incorrect 146 ms 11640 KB Output isn't correct
83 Incorrect 106 ms 9592 KB Output isn't correct
84 Incorrect 115 ms 9336 KB Output isn't correct
85 Incorrect 105 ms 8804 KB Output isn't correct
86 Correct 124 ms 9592 KB Output is correct
87 Correct 128 ms 9976 KB Output is correct
88 Incorrect 117 ms 11768 KB Output isn't correct
89 Incorrect 135 ms 10828 KB Output isn't correct
90 Incorrect 81 ms 9336 KB Output isn't correct
91 Incorrect 119 ms 9208 KB Output isn't correct
92 Incorrect 103 ms 7800 KB Output isn't correct
93 Incorrect 120 ms 10372 KB Output isn't correct
94 Incorrect 135 ms 11112 KB Output isn't correct
95 Incorrect 91 ms 7416 KB Output isn't correct
96 Correct 68 ms 5496 KB Output is correct
97 Incorrect 95 ms 9720 KB Output isn't correct
98 Correct 153 ms 11512 KB Output is correct
99 Correct 93 ms 9976 KB Output is correct
100 Incorrect 103 ms 9080 KB Output isn't correct
101 Incorrect 34 ms 8448 KB Output isn't correct
102 Incorrect 132 ms 12024 KB Output isn't correct