oj.uz

Submission #573755

# Submission time Handle Problem Language Result Execution time Memory
573755 2022-06-07T07:14:26 Z Theo830 Art Class (IOI13_artclass) C++17
49 / 100
 99 ms 9072 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INF = 1e9+7;
ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
#include "artclass.h"
/*
#ifndef __ARTCLASS_H__
#define __ARTCLASS_H__

#ifdef __cplusplus
extern "C" {
#endif

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]);

#ifdef __cplusplus
}
#endif

#endif
#include <stdio.h>
static int DIM[2];
static int R[500][500];
static int G[500][500];
static int B[500][500];

int main() {
    FILE *in = fopen("artclass.txt", "r");
    if(in == NULL) {
        puts("Failed to open input file (artclass.txt).");
        return 0;
    }

    if(fscanf(in, "%d%d", DIM, DIM+1) != 2) {
        printf("Line 1: H, W must be integers\n");
        return 0;
    }
    if(DIM[0] < 100 || 500 < DIM[0]) {
        printf("Line 1: 100 <= H <= 500\n");
        return 0;
    }
    if(DIM[1] < 100 || 500 < DIM[1]) {
        printf("Line 1: 100 <= W <= 500\n");
        return 0;
    }
    for(int i = 0; i< DIM[0]; i++) {
       for(int j = 0; j < DIM[1]; j++) {
           if(fscanf(in, "%d%d%d", &R[i][j], &G[i][j], &B[i][j]) != 3) {
               printf("Line %d: R[i][j], G[i][j], B[i][j] must be integers", i*DIM[1]+j+2, i, j);
               return 0;
           }
           if(R[i][j] < 0 || 255 < R[i][j]) {
               printf("Line %d: 0 <= R[%d][%d] <= 255", i*DIM[1]+j+2, i, j);
               return 0;
           }
           if(G[i][j] < 0 || 255 < G[i][j]) {
               printf("Line %d: 0 <= G[%d][%d] <= 255", i*DIM[1]+j+2, i, j);
               return 0;
           }
           if(B[i][j] < 0 || 255 < B[i][j]) {
               printf("Line %d: 0 <= B[%d][%d] <= 255", i*DIM[1]+j+2, i, j);
               return 0;
           }
       }
    }

    printf("%d\n", style(DIM[0], DIM[1], R, G, B));
    return 0;
}
*/
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
    ll n = H,m = W;
    ll posa = (n * m) / 3;
    ll polla = 35000;
    ll ans;
    set<ll>ex;
    ll prasina = 0;
    ll aspro = 0;
    ll mavro = 0;
    ll allages = 0;
    f(i,0,n){
        f(j,0,m){
            ex.insert(R[i][j] + 256 * G[i][j] + 256 * 256 * B[i][j]);
            if(G[i][j] >= max({20,R[i][j] - 20,B[i][j] - 20})){
                prasina++;
            }
            if(min({G[i][j],R[i][j],B[i][j]}) >= 170){
                aspro++;
            }
            if(max({G[i][j],R[i][j],B[i][j]}) <= 70 && max({G[i][j],R[i][j],B[i][j]}) - min({G[i][j],R[i][j],B[i][j]}) <= 20){
                mavro++;
            }
            if(j != 0){
                allages += (abs(G[i][j] - G[i][j-1]) + abs(B[i][j] - B[i][j-1]) + abs(R[i][j] - R[i][j-1])) >= 100;
            }
        }
    }
    if((ll)ex.size() >= 65000 || (polla <= (ll)ex.size() && allages >= (n * m) / 8)){
         if(prasina >= posa && allages <= posa){
            ans = 2;
         }
         else{
            ans = 3;
         }
    }
    else{
        if(aspro >= (n * m) / 8){
            ans = 1;
        }
        else{
            ans = 4;
        }
    }
    return ans;
}

Subtask #1
49.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 3788 KB Output is correct
2 Incorrect 68 ms 5580 KB Output isn't correct
3 Correct 77 ms 6604 KB Output is correct
4 Correct 70 ms 4432 KB Output is correct
5 Incorrect 82 ms 7812 KB Output isn't correct
6 Correct 50 ms 4340 KB Output is correct
7 Incorrect 82 ms 4788 KB Output isn't correct
8 Correct 46 ms 3760 KB Output is correct
9 Incorrect 66 ms 5324 KB Output isn't correct
10 Correct 59 ms 4812 KB Output is correct
11 Incorrect 85 ms 7792 KB Output isn't correct
12 Correct 76 ms 6624 KB Output is correct
13 Incorrect 61 ms 5112 KB Output isn't correct
14 Correct 49 ms 3660 KB Output is correct
15 Incorrect 66 ms 4728 KB Output isn't correct
16 Correct 60 ms 4556 KB Output is correct
17 Correct 66 ms 5368 KB Output is correct
18 Correct 37 ms 4348 KB Output is correct
19 Correct 70 ms 5256 KB Output is correct
20 Correct 61 ms 4012 KB Output is correct
21 Incorrect 59 ms 5044 KB Output isn't correct
22 Correct 80 ms 7596 KB Output is correct
23 Incorrect 45 ms 4028 KB Output isn't correct
24 Incorrect 55 ms 4808 KB Output isn't correct
25 Correct 81 ms 6828 KB Output is correct
26 Correct 58 ms 3888 KB Output is correct
27 Correct 48 ms 2920 KB Output is correct
28 Correct 48 ms 4520 KB Output is correct
29 Incorrect 61 ms 3908 KB Output isn't correct
30 Correct 79 ms 6336 KB Output is correct
31 Correct 60 ms 4296 KB Output is correct
32 Correct 51 ms 3552 KB Output is correct
33 Correct 44 ms 4020 KB Output is correct
34 Incorrect 68 ms 3280 KB Output isn't correct
35 Correct 76 ms 5656 KB Output is correct
36 Correct 56 ms 4324 KB Output is correct
37 Correct 66 ms 3788 KB Output is correct
38 Correct 53 ms 4548 KB Output is correct
39 Correct 79 ms 7112 KB Output is correct
40 Incorrect 79 ms 6372 KB Output isn't correct
41 Correct 67 ms 5136 KB Output is correct
42 Incorrect 74 ms 4856 KB Output isn't correct
43 Correct 45 ms 4692 KB Output is correct
44 Incorrect 51 ms 4812 KB Output isn't correct
45 Correct 58 ms 4364 KB Output is correct
46 Incorrect 90 ms 6264 KB Output isn't correct
47 Correct 80 ms 6604 KB Output is correct
48 Correct 53 ms 4008 KB Output is correct
49 Correct 72 ms 6408 KB Output is correct
50 Incorrect 56 ms 3284 KB Output isn't correct
51 Correct 41 ms 4208 KB Output is correct
52 Incorrect 98 ms 7368 KB Output isn't correct
53 Correct 66 ms 3816 KB Output is correct
54 Correct 65 ms 4532 KB Output is correct
55 Incorrect 68 ms 5072 KB Output isn't correct
56 Correct 67 ms 3856 KB Output is correct
57 Correct 94 ms 8096 KB Output is correct
58 Correct 43 ms 3788 KB Output is correct
59 Incorrect 53 ms 4144 KB Output isn't correct
60 Incorrect 60 ms 4680 KB Output isn't correct
61 Incorrect 57 ms 4116 KB Output isn't correct
62 Correct 75 ms 6424 KB Output is correct
63 Correct 75 ms 6056 KB Output is correct
64 Correct 48 ms 3660 KB Output is correct
65 Correct 53 ms 3940 KB Output is correct
66 Correct 81 ms 6124 KB Output is correct
67 Correct 89 ms 7172 KB Output is correct
68 Incorrect 55 ms 3472 KB Output isn't correct
69 Correct 59 ms 4528 KB Output is correct
70 Correct 57 ms 3960 KB Output is correct
71 Correct 87 ms 7824 KB Output is correct
72 Correct 75 ms 4548 KB Output is correct
73 Correct 74 ms 4808 KB Output is correct
74 Correct 49 ms 4684 KB Output is correct
75 Incorrect 72 ms 5536 KB Output isn't correct
76 Correct 84 ms 7612 KB Output is correct
77 Incorrect 69 ms 6800 KB Output isn't correct
78 Correct 99 ms 6760 KB Output is correct
79 Correct 46 ms 3884 KB Output is correct
80 Correct 63 ms 4984 KB Output is correct
81 Correct 82 ms 7500 KB Output is correct
82 Correct 66 ms 3660 KB Output is correct
83 Incorrect 19 ms 2004 KB Output isn't correct
84 Incorrect 78 ms 5636 KB Output isn't correct
85 Incorrect 77 ms 5208 KB Output isn't correct
86 Correct 56 ms 4044 KB Output is correct
87 Correct 78 ms 7552 KB Output is correct
88 Correct 63 ms 6524 KB Output is correct
89 Incorrect 76 ms 6504 KB Output isn't correct
90 Correct 71 ms 4208 KB Output is correct
91 Correct 89 ms 7244 KB Output is correct
92 Incorrect 64 ms 5068 KB Output isn't correct
93 Correct 65 ms 6448 KB Output is correct
94 Correct 73 ms 6328 KB Output is correct
95 Correct 55 ms 2648 KB Output is correct
96 Incorrect 95 ms 9072 KB Output isn't correct
97 Correct 15 ms 3284 KB Output is correct
98 Incorrect 92 ms 7072 KB Output isn't correct
99 Incorrect 54 ms 3744 KB Output isn't correct
100 Correct 58 ms 3824 KB Output is correct
101 Correct 59 ms 3668 KB Output is correct
102 Correct 76 ms 6592 KB Output is correct