oj.uz

Submission #573731

# Submission time Handle Problem Language Result Execution time Memory
573731 2022-06-07T06:09:02 Z Theo830 Art Class (IOI13_artclass) C++17
1 / 100
 98 ms 8988 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
///Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<ll> distr;
ll rnd(ll a, ll b){return distr(rng)%(b-a+1)+a;}
#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) / 8;
    ll polla = 50 * 50 * 50;
    ll ans;
  	set<ll>ex;
  	ll prasina = 0;
  	ll aspro = 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] >= 50 && max(R[i][j],B[i][j]) <= 20){
              	prasina++;
            }
            if(max({G[i][j],R[i][j],B[i][j]}) <= 70){
                aspro++;
            }
        }
    }
    if(polla <= (ll)ex.size()){
         if(prasina >= posa){
            ans = 2;
         }
         else{
            ans = 3;
         }
    }
    else{
        if(aspro >= posa){
            ans = 1;
        }
        else{
            ans = 4;
        }
    }
    return ans;
}

Subtask #1
1.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 80 ms 7136 KB Output isn't correct
2 Incorrect 76 ms 6468 KB Output isn't correct
3 Incorrect 88 ms 7100 KB Output isn't correct
4 Incorrect 48 ms 3532 KB Output isn't correct
5 Incorrect 63 ms 3804 KB Output isn't correct
6 Incorrect 65 ms 6484 KB Output isn't correct
7 Incorrect 50 ms 4588 KB Output isn't correct
8 Correct 57 ms 3668 KB Output is correct
9 Incorrect 49 ms 3660 KB Output isn't correct
10 Incorrect 74 ms 3784 KB Output isn't correct
11 Incorrect 59 ms 6040 KB Output isn't correct
12 Incorrect 89 ms 7856 KB Output isn't correct
13 Correct 92 ms 6348 KB Output is correct
14 Incorrect 73 ms 5616 KB Output isn't correct
15 Incorrect 18 ms 2004 KB Output isn't correct
16 Correct 44 ms 4256 KB Output is correct
17 Incorrect 70 ms 3632 KB Output isn't correct
18 Correct 50 ms 3996 KB Output is correct
19 Incorrect 82 ms 7456 KB Output isn't correct
20 Correct 52 ms 3404 KB Output is correct
21 Incorrect 77 ms 6624 KB Output isn't correct
22 Incorrect 88 ms 7640 KB Output isn't correct
23 Correct 52 ms 4552 KB Output is correct
24 Incorrect 86 ms 6504 KB Output isn't correct
25 Correct 74 ms 4596 KB Output is correct
26 Incorrect 84 ms 6352 KB Output isn't correct
27 Correct 55 ms 3304 KB Output is correct
28 Incorrect 64 ms 6612 KB Output isn't correct
29 Incorrect 50 ms 4692 KB Output isn't correct
30 Correct 98 ms 8988 KB Output is correct
31 Incorrect 96 ms 6236 KB Output isn't correct
32 Correct 66 ms 4472 KB Output is correct
33 Incorrect 49 ms 2792 KB Output isn't correct
34 Correct 64 ms 4044 KB Output is correct
35 Incorrect 92 ms 6888 KB Output isn't correct
36 Incorrect 97 ms 7624 KB Output isn't correct
37 Incorrect 81 ms 5196 KB Output isn't correct
38 Correct 62 ms 3876 KB Output is correct
39 Incorrect 80 ms 7884 KB Output isn't correct
40 Incorrect 40 ms 3772 KB Output isn't correct
41 Correct 45 ms 4356 KB Output is correct
42 Correct 37 ms 2640 KB Output is correct
43 Correct 67 ms 4240 KB Output is correct
44 Incorrect 78 ms 6736 KB Output isn't correct
45 Correct 57 ms 3236 KB Output is correct
46 Incorrect 75 ms 6496 KB Output isn't correct
47 Incorrect 62 ms 4828 KB Output isn't correct
48 Incorrect 70 ms 5364 KB Output isn't correct
49 Incorrect 70 ms 4916 KB Output isn't correct
50 Incorrect 79 ms 7276 KB Output isn't correct
51 Incorrect 15 ms 3340 KB Output isn't correct
52 Correct 54 ms 3976 KB Output is correct
53 Correct 70 ms 4780 KB Output is correct
54 Incorrect 48 ms 4884 KB Output isn't correct
55 Incorrect 67 ms 3520 KB Output isn't correct
56 Correct 54 ms 4500 KB Output is correct
57 Correct 52 ms 4116 KB Output is correct
58 Correct 46 ms 4116 KB Output is correct
59 Incorrect 75 ms 3868 KB Output isn't correct
60 Incorrect 98 ms 5688 KB Output isn't correct
61 Correct 55 ms 3956 KB Output is correct
62 Incorrect 71 ms 4140 KB Output isn't correct
63 Correct 64 ms 5068 KB Output is correct
64 Incorrect 78 ms 5708 KB Output isn't correct
65 Incorrect 74 ms 6296 KB Output isn't correct
66 Correct 58 ms 4132 KB Output is correct
67 Incorrect 49 ms 4356 KB Output isn't correct
68 Incorrect 57 ms 4424 KB Output isn't correct
69 Incorrect 59 ms 6608 KB Output isn't correct
70 Incorrect 62 ms 5096 KB Output isn't correct
71 Incorrect 61 ms 5116 KB Output isn't correct
72 Incorrect 46 ms 3732 KB Output isn't correct
73 Correct 63 ms 4752 KB Output is correct
74 Incorrect 61 ms 3776 KB Output isn't correct
75 Incorrect 84 ms 8080 KB Output isn't correct
76 Incorrect 64 ms 4940 KB Output isn't correct
77 Incorrect 80 ms 3964 KB Output isn't correct
78 Incorrect 80 ms 6344 KB Output isn't correct
79 Incorrect 66 ms 5328 KB Output isn't correct
80 Incorrect 67 ms 5196 KB Output isn't correct
81 Incorrect 73 ms 5156 KB Output isn't correct
82 Incorrect 69 ms 6760 KB Output isn't correct
83 Correct 65 ms 4508 KB Output is correct
84 Incorrect 81 ms 7884 KB Output isn't correct
85 Correct 58 ms 3912 KB Output is correct
86 Incorrect 41 ms 3836 KB Output isn't correct
87 Incorrect 73 ms 6356 KB Output isn't correct
88 Incorrect 83 ms 7160 KB Output isn't correct
89 Incorrect 71 ms 5616 KB Output isn't correct
90 Incorrect 65 ms 4400 KB Output isn't correct
91 Incorrect 46 ms 4784 KB Output isn't correct
92 Correct 61 ms 4432 KB Output is correct
93 Correct 52 ms 4048 KB Output is correct
94 Correct 61 ms 4508 KB Output is correct
95 Incorrect 61 ms 4812 KB Output isn't correct
96 Incorrect 70 ms 5364 KB Output isn't correct
97 Incorrect 49 ms 4300 KB Output isn't correct
98 Incorrect 81 ms 6608 KB Output isn't correct
99 Incorrect 53 ms 3820 KB Output isn't correct
100 Incorrect 78 ms 4832 KB Output isn't correct
101 Incorrect 87 ms 7512 KB Output isn't correct
102 Incorrect 87 ms 7336 KB Output isn't correct