oj.uz

Submission #573750

# Submission time Handle Problem Language Result Execution time Memory
573750 2022-06-07T07:01:35 Z Theo830 Art Class (IOI13_artclass) C++17
0 / 100
 96 ms 9108 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({70,R[i][j],B[i][j]})){
                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;
            }
        }
    }
    cout<<ex.size()<<endl;
    if(polla <= (ll)ex.size()){
         if(prasina >= posa && allages <= posa){
            ans = 2;
         }
         else{
            ans = 3;
         }
    }
    else{
        if(aspro >= (n * m) / 8 && mavro >= (n * m) / 64){
            ans = 1;
        }
        else{
            ans = 4;
        }
    }
    return ans;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 65 ms 3560 KB Output isn't correct
2 Incorrect 60 ms 4044 KB Output isn't correct
3 Incorrect 86 ms 7496 KB Output isn't correct
4 Incorrect 96 ms 9108 KB Output isn't correct
5 Incorrect 86 ms 8216 KB Output isn't correct
6 Incorrect 59 ms 4012 KB Output isn't correct
7 Incorrect 85 ms 3788 KB Output isn't correct
8 Incorrect 47 ms 4300 KB Output isn't correct
9 Incorrect 83 ms 7856 KB Output isn't correct
10 Incorrect 48 ms 4556 KB Output isn't correct
11 Incorrect 83 ms 7872 KB Output isn't correct
12 Incorrect 42 ms 4216 KB Output isn't correct
13 Incorrect 59 ms 3788 KB Output isn't correct
14 Incorrect 16 ms 3284 KB Output isn't correct
15 Incorrect 69 ms 4760 KB Output isn't correct
16 Incorrect 44 ms 3896 KB Output isn't correct
17 Incorrect 63 ms 5296 KB Output isn't correct
18 Incorrect 76 ms 6408 KB Output isn't correct
19 Incorrect 59 ms 5148 KB Output isn't correct
20 Incorrect 62 ms 4380 KB Output isn't correct
21 Incorrect 60 ms 4020 KB Output isn't correct
22 Incorrect 60 ms 4856 KB Output isn't correct
23 Incorrect 94 ms 7196 KB Output isn't correct
24 Incorrect 76 ms 6448 KB Output isn't correct
25 Incorrect 83 ms 7140 KB Output isn't correct
26 Incorrect 83 ms 6848 KB Output isn't correct
27 Incorrect 46 ms 4056 KB Output isn't correct
28 Incorrect 93 ms 7104 KB Output isn't correct
29 Incorrect 91 ms 6356 KB Output isn't correct
30 Incorrect 64 ms 5344 KB Output isn't correct
31 Incorrect 82 ms 6780 KB Output isn't correct
32 Incorrect 59 ms 4220 KB Output isn't correct
33 Incorrect 38 ms 3580 KB Output isn't correct
34 Incorrect 63 ms 3800 KB Output isn't correct
35 Incorrect 83 ms 4580 KB Output isn't correct
36 Incorrect 76 ms 7092 KB Output isn't correct
37 Incorrect 53 ms 3276 KB Output isn't correct
38 Incorrect 79 ms 3820 KB Output isn't correct
39 Incorrect 71 ms 4520 KB Output isn't correct
40 Incorrect 61 ms 4792 KB Output isn't correct
41 Incorrect 81 ms 5160 KB Output isn't correct
42 Incorrect 65 ms 4224 KB Output isn't correct
43 Incorrect 55 ms 3864 KB Output isn't correct
44 Incorrect 39 ms 3856 KB Output isn't correct
45 Incorrect 62 ms 4488 KB Output isn't correct
46 Incorrect 74 ms 6520 KB Output isn't correct
47 Incorrect 78 ms 6588 KB Output isn't correct
48 Incorrect 22 ms 1972 KB Output isn't correct
49 Incorrect 48 ms 4792 KB Output isn't correct
50 Incorrect 36 ms 4320 KB Output isn't correct
51 Incorrect 58 ms 4428 KB Output isn't correct
52 Incorrect 76 ms 4172 KB Output isn't correct
53 Incorrect 52 ms 3672 KB Output isn't correct
54 Incorrect 70 ms 4424 KB Output isn't correct
55 Incorrect 70 ms 6700 KB Output isn't correct
56 Incorrect 87 ms 7524 KB Output isn't correct
57 Incorrect 91 ms 7900 KB Output isn't correct
58 Incorrect 75 ms 6384 KB Output isn't correct
59 Incorrect 73 ms 5580 KB Output isn't correct
60 Incorrect 72 ms 6348 KB Output isn't correct
61 Incorrect 59 ms 6044 KB Output isn't correct
62 Incorrect 44 ms 3676 KB Output isn't correct
63 Incorrect 74 ms 5136 KB Output isn't correct
64 Incorrect 75 ms 5860 KB Output isn't correct
65 Incorrect 64 ms 6572 KB Output isn't correct
66 Incorrect 71 ms 4568 KB Output isn't correct
67 Incorrect 79 ms 5108 KB Output isn't correct
68 Incorrect 55 ms 3992 KB Output isn't correct
69 Incorrect 79 ms 3572 KB Output isn't correct
70 Incorrect 48 ms 2804 KB Output isn't correct
71 Incorrect 46 ms 3904 KB Output isn't correct
72 Incorrect 73 ms 3888 KB Output isn't correct
73 Incorrect 77 ms 5540 KB Output isn't correct
74 Incorrect 60 ms 4516 KB Output isn't correct
75 Incorrect 90 ms 7628 KB Output isn't correct
76 Incorrect 56 ms 3836 KB Output isn't correct
77 Incorrect 67 ms 5128 KB Output isn't correct
78 Incorrect 77 ms 6788 KB Output isn't correct
79 Incorrect 73 ms 4940 KB Output isn't correct
80 Incorrect 57 ms 3976 KB Output isn't correct
81 Incorrect 78 ms 6328 KB Output isn't correct
82 Incorrect 78 ms 5668 KB Output isn't correct
83 Incorrect 84 ms 7668 KB Output isn't correct
84 Incorrect 74 ms 3676 KB Output isn't correct
85 Incorrect 88 ms 4888 KB Output isn't correct
86 Incorrect 83 ms 5320 KB Output isn't correct
87 Incorrect 75 ms 6348 KB Output isn't correct
88 Incorrect 95 ms 7360 KB Output isn't correct
89 Incorrect 69 ms 4672 KB Output isn't correct
90 Incorrect 58 ms 5036 KB Output isn't correct
91 Incorrect 44 ms 4684 KB Output isn't correct
92 Incorrect 67 ms 3896 KB Output isn't correct
93 Incorrect 57 ms 4908 KB Output isn't correct
94 Incorrect 80 ms 6656 KB Output isn't correct
95 Incorrect 58 ms 3360 KB Output isn't correct
96 Incorrect 37 ms 2636 KB Output isn't correct
97 Incorrect 59 ms 3244 KB Output isn't correct
98 Incorrect 46 ms 4540 KB Output isn't correct
99 Incorrect 64 ms 6652 KB Output isn't correct
100 Incorrect 45 ms 4900 KB Output isn't correct
101 Incorrect 81 ms 6156 KB Output isn't correct
102 Incorrect 41 ms 4316 KB Output isn't correct