oj.uz

답안 #816503

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
816503 2023-08-09T05:22:25 Z Magikarp4000 미술 수업 (IOI13_artclass) C++17
32 / 100
 75 ms 11736 KB 
#include "artclass.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

const int dx[] = {0,0,1,-1};
const int dy[] = {1,-1,0,0};
const int VAR = 15;
const int LINEVAR = 50;
const int EPS = 10;
const int EPS1 = 10;

struct Coord {
    PII tp,ri,bt,le;
};

const int MAXN = 5e2+5;
int h, w, r[MAXN][MAXN], g[MAXN][MAXN], b[MAXN][MAXN], z[MAXN][MAXN];
vector<Coord> v;
vector<int> cnts;

bool same(int x1, int y1, int x2, int y2) {
    if (abs(r[y1][x1]-r[y2][x2]) > VAR) return 0;
    if (abs(g[y1][x1]-g[y2][x2]) > VAR) return 0;
    if (abs(b[y1][x1]-b[y2][x2]) > VAR) return 0;
    return 1;
    // int diff = abs(r[y1][x1]-r[y2][x2])+abs(g[y1][x1]-g[y2][x2])+abs(b[y1][x1]-b[y2][x2]);
}

bool black(int x, int y) {
    if (r[y][x] > LINEVAR) return 0;
    if (g[y][x] > LINEVAR) return 0;
    if (b[y][x] > LINEVAR) return 0;
    return 1;
}

bool green(int x, int y) {
    return (g[y][x] > r[y][x] && g[y][x] > b[y][x]);
}

void bfs(int sx, int sy, int idx) {
    queue<PII> q;
    q.push({sx,sy});
    Coord cur = {{INF,INF},{-INF,INF},{-INF,-INF},{INF,-INF}};
    int cnt = 0;
    while (!q.empty()) {
        int x = q.front().F, y = q.front().S;
        q.pop();
        z[y][x] = idx;
        cnt++;
        if (y < cur.tp.S || (y == cur.tp.S && x < cur.tp.F)) cur.tp = {x,y};
        if (x > cur.ri.F || (x == cur.ri.F && y < cur.ri.S)) cur.ri = {x,y};
        if (y > cur.bt.S || (y == cur.bt.S && x > cur.bt.F)) cur.bt = {x,y};
        if (x < cur.le.F || (x == cur.le.F && y > cur.le.S)) cur.le = {x,y};
        FOR(i,0,4) {
            int nx = x+dx[i], ny = y+dy[i];
            if (nx < 0 || nx >= w || ny < 0 || ny >= h) continue;
            if (z[ny][nx]) continue;
            if (same(x,y,nx,ny)) {
                z[ny][nx] = idx;
                q.push({nx,ny});
            }
        }
    }
    // FOR(i,0,h) {
    //     FOR(j,0,w) {
    //         if (z[i][j]) {
    //             cur.tp = {j,i};
    //             break;
    //         }
    //     }
    // }
    // FORR(j,w-1,-1) {
    //     FOR(i,0,h) {
    //         if (z[i][j]) {
    //             cur.ri = {j,i};
    //             break;
    //         }
    //     }
    // }
    // FORR(i,h-1,-1) {
    //     FORR(j,w-1,-1) {
    //         if (z[i][j]) {
    //             cur.bt = {j,i};
    //             break;
    //         }
    //     }
    // }
    // FOR(j,0,w) {
    //     FORR(i,h,-1) {
    //         if (z[i][j]) {
    //             cur.le = {j,i};
    //             break;
    //         }
    //     }
    // }
    v.PB(cur);
    cnts.PB(cnt);
    // int cnt = 0;
    // FOR(i,0,h) FOR(j,0,w) cnt += z[i][j] > 0;
    // cnts.PB(cnt);
}

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
    h = H, w = W;
    FOR(i,0,h) FOR(j,0,w) r[i][j] = R[i][j], g[i][j] = G[i][j], b[i][j] = B[i][j];
    int idx = 1;
    FOR(i,0,h) {
        FOR(j,0,w) {
            if (z[i][j]) continue;
            // if (r[i][j]+g[i][j]+b[i][j] <= VAR) continue;
            bfs(j,i,idx++);
        }
    }
    int line = 0;
    bool prev = 0;
    FOR(i,0,h) {
        int bad = 0;
        FOR(j,0,w) bad += !black(j,i);
        if (bad <= 15) {
            if (!prev) line++;
            prev = 1;
        }
        else prev = 0;
    }
    prev = 0;
    FOR(j,0,w) {
        int bad = 0;
        FOR(i,0,h) bad += !black(j,i);
        if (bad <= 15) {
            if (!prev) line++;
            prev = 1;
        }
        else prev = 0;
    }
    // cout << "line: " << line << ln;
    // if (line >= 10) return 1;
    int vn = v.size(), num = 0;
    FOR(i,0,vn) if (cnts[i] >= 30) num++;
    if (num >= 6 && line >= 7) return 1;
    int num1 = 0;
    FOR(i,0,vn) if (cnts[i] >= h*w/5) num1++;
    if (num1 >= num*3/5) return 4;
    // FOR(i,0,vn) {
    //     if (cnts[i] <= 20) continue;
    //     Coord u = v[i];
    //     // cout << u.tp.F << " " << u.tp.S << " ";
    //     // cout << u.ri.F << " " << u.ri.S << " ";
    //     // cout << u.bt.F << " " << u.bt.S << " ";
    //     // cout << u.le.F << " " << u.le.S << ln;
    //     // cout << cnts[i] << ln;
    //     int val = (u.le.S-u.tp.S)*(u.ri.F-u.bt.F);
    //     int val1 = (u.bt.S-u.ri.S)*(u.tp.F-u.le.F);
    //     if (abs(val-val1) <= EPS) num++;
    // }
    // if (num >= 20) return 1;
    FOR(k,0,vn) {
        Coord u = v[k];
        int area = (u.bt.S-u.tp.S)*(u.ri.F-u.le.F);
        // cout << "area: " << area << ln;
        // if (area >= cnts[k]*9/10 && area <= cnts[k]*11/10) return 4;
        // continue;
        if (abs(u.ri.S-u.tp.S) <= EPS1
            && abs(u.ri.F-u.bt.F) <= EPS1
            && abs(u.bt.S-u.le.S) <= EPS1
            && abs(u.tp.F-u.le.F) <= EPS1
        ) {
            if (area <= h*w/10) continue;
            int bad = 0;
            FOR(i,u.tp.S,u.bt.S+1) {
                FOR(j,u.le.F,u.ri.F+1) {
                    if (z[i][j] != k+1) {
                        bad++;
                    }
                }
            }
            if (bad <= 10) return 4; 
        }
    }
    // int gre = 0;
    // FOR(i,0,h) FOR(j,0,w) gre += green(j,i);
    // if (gre >= h*w/3) return 2;
    int red = 0, gre = 0, blu = 0;
    FOR(i,0,h) FOR(j,0,w) red += r[i][j], gre += g[i][j], blu += b[i][j];
    if (gre > red && gre > blu) return 2;
    // FORX(u,cnts) if (u >= h*w/4) return 4;
    return 3;
}

Subtask #1
32.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 43 ms 6296 KB Output isn't correct
2 Correct 30 ms 4944 KB Output is correct
3 Correct 50 ms 7224 KB Output is correct
4 Correct 45 ms 7704 KB Output is correct
5 Correct 54 ms 10664 KB Output is correct
6 Incorrect 52 ms 7208 KB Output isn't correct
7 Correct 51 ms 9552 KB Output is correct
8 Correct 38 ms 7088 KB Output is correct
9 Incorrect 50 ms 8296 KB Output isn't correct
10 Incorrect 56 ms 8420 KB Output isn't correct
11 Incorrect 34 ms 5092 KB Output isn't correct
12 Correct 42 ms 7196 KB Output is correct
13 Correct 40 ms 7140 KB Output is correct
14 Incorrect 46 ms 7152 KB Output isn't correct
15 Incorrect 45 ms 7288 KB Output isn't correct
16 Incorrect 48 ms 6972 KB Output isn't correct
17 Correct 34 ms 8420 KB Output is correct
18 Correct 41 ms 5768 KB Output is correct
19 Correct 26 ms 5320 KB Output is correct
20 Correct 48 ms 7336 KB Output is correct
21 Correct 50 ms 10472 KB Output is correct
22 Correct 43 ms 7108 KB Output is correct
23 Incorrect 43 ms 6352 KB Output isn't correct
24 Correct 45 ms 9504 KB Output is correct
25 Correct 39 ms 7060 KB Output is correct
26 Correct 41 ms 8908 KB Output is correct
27 Incorrect 45 ms 6456 KB Output isn't correct
28 Incorrect 40 ms 7200 KB Output isn't correct
29 Correct 48 ms 7276 KB Output is correct
30 Incorrect 31 ms 7180 KB Output isn't correct
31 Incorrect 41 ms 7192 KB Output isn't correct
32 Incorrect 32 ms 7208 KB Output isn't correct
33 Incorrect 43 ms 7536 KB Output isn't correct
34 Correct 34 ms 7192 KB Output is correct
35 Correct 13 ms 2872 KB Output is correct
36 Incorrect 47 ms 7248 KB Output isn't correct
37 Incorrect 33 ms 7112 KB Output isn't correct
38 Incorrect 34 ms 7192 KB Output isn't correct
39 Correct 52 ms 6808 KB Output is correct
40 Correct 46 ms 7172 KB Output is correct
41 Incorrect 44 ms 6352 KB Output isn't correct
42 Incorrect 52 ms 7800 KB Output isn't correct
43 Incorrect 46 ms 7624 KB Output isn't correct
44 Correct 50 ms 7216 KB Output is correct
45 Correct 54 ms 11584 KB Output is correct
46 Correct 50 ms 11588 KB Output is correct
47 Incorrect 50 ms 7176 KB Output isn't correct
48 Correct 45 ms 9576 KB Output is correct
49 Correct 51 ms 11444 KB Output is correct
50 Incorrect 50 ms 7128 KB Output isn't correct
51 Correct 53 ms 11596 KB Output is correct
52 Correct 41 ms 6816 KB Output is correct
53 Incorrect 54 ms 7364 KB Output isn't correct
54 Correct 41 ms 7176 KB Output is correct
55 Correct 39 ms 7132 KB Output is correct
56 Correct 40 ms 7192 KB Output is correct
57 Correct 53 ms 8240 KB Output is correct
58 Incorrect 45 ms 7904 KB Output isn't correct
59 Correct 43 ms 6240 KB Output is correct
60 Incorrect 49 ms 7372 KB Output isn't correct
61 Correct 45 ms 6944 KB Output is correct
62 Incorrect 45 ms 6980 KB Output isn't correct
63 Correct 41 ms 6136 KB Output is correct
64 Correct 41 ms 7160 KB Output is correct
65 Incorrect 43 ms 7500 KB Output isn't correct
66 Correct 44 ms 7532 KB Output is correct
67 Correct 15 ms 7184 KB Output is correct
68 Correct 41 ms 11736 KB Output is correct
69 Correct 48 ms 6688 KB Output is correct
70 Incorrect 45 ms 7812 KB Output isn't correct
71 Correct 56 ms 6408 KB Output is correct
72 Correct 33 ms 8380 KB Output is correct
73 Correct 30 ms 7124 KB Output is correct
74 Correct 51 ms 10428 KB Output is correct
75 Correct 30 ms 7168 KB Output is correct
76 Incorrect 51 ms 8472 KB Output isn't correct
77 Correct 45 ms 7744 KB Output is correct
78 Incorrect 28 ms 4424 KB Output isn't correct
79 Correct 62 ms 10280 KB Output is correct
80 Correct 42 ms 11556 KB Output is correct
81 Correct 29 ms 7188 KB Output is correct
82 Correct 46 ms 11640 KB Output is correct
83 Correct 53 ms 11708 KB Output is correct
84 Correct 44 ms 7156 KB Output is correct
85 Correct 39 ms 5752 KB Output is correct
86 Correct 26 ms 5400 KB Output is correct
87 Incorrect 34 ms 7172 KB Output isn't correct
88 Incorrect 75 ms 7556 KB Output isn't correct
89 Incorrect 51 ms 7416 KB Output isn't correct
90 Correct 29 ms 5564 KB Output is correct
91 Correct 35 ms 8348 KB Output is correct
92 Incorrect 43 ms 7492 KB Output isn't correct
93 Incorrect 53 ms 7116 KB Output isn't correct
94 Correct 54 ms 7228 KB Output is correct
95 Incorrect 48 ms 7856 KB Output isn't correct
96 Correct 32 ms 7104 KB Output is correct
97 Incorrect 52 ms 7620 KB Output isn't correct
98 Correct 48 ms 8260 KB Output is correct
99 Correct 54 ms 7132 KB Output is correct
100 Incorrect 54 ms 7116 KB Output isn't correct
101 Incorrect 54 ms 7636 KB Output isn't correct
102 Incorrect 49 ms 7108 KB Output isn't correct