oj.uz

Submission #573749

# Submission time Handle Problem Language Result Execution time Memory
573749 2022-06-07T06:56:22 Z Theo830 Art Class (IOI13_artclass) C++17
8 / 100
 69 ms 3440 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 = 50000 / 8;
    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] / 8) + 256 * (G[i][j] / 8) + 256 * 256 * (B[i][j] / 8));
          	if(G[i][j] >= max({50,R[i][j] - 10,B[i][j] - 10})){
              	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(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
8.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 3196 KB Output is correct
2 Correct 44 ms 3304 KB Output is correct
3 Incorrect 59 ms 3408 KB Output isn't correct
4 Incorrect 52 ms 2636 KB Output isn't correct
5 Correct 57 ms 3300 KB Output is correct
6 Incorrect 34 ms 1936 KB Output isn't correct
7 Correct 46 ms 3208 KB Output is correct
8 Correct 53 ms 3312 KB Output is correct
9 Incorrect 55 ms 2916 KB Output isn't correct
10 Incorrect 52 ms 2804 KB Output isn't correct
11 Correct 48 ms 3240 KB Output is correct
12 Correct 48 ms 3260 KB Output is correct
13 Correct 45 ms 3176 KB Output is correct
14 Incorrect 56 ms 3276 KB Output isn't correct
15 Correct 56 ms 3220 KB Output is correct
16 Correct 34 ms 3248 KB Output is correct
17 Correct 54 ms 3276 KB Output is correct
18 Incorrect 56 ms 3304 KB Output isn't correct
19 Incorrect 43 ms 2180 KB Output isn't correct
20 Correct 59 ms 3220 KB Output is correct
21 Correct 46 ms 3276 KB Output is correct
22 Correct 32 ms 3224 KB Output is correct
23 Correct 40 ms 3156 KB Output is correct
24 Correct 52 ms 3276 KB Output is correct
25 Incorrect 53 ms 2760 KB Output isn't correct
26 Correct 52 ms 3184 KB Output is correct
27 Incorrect 62 ms 2280 KB Output isn't correct
28 Incorrect 50 ms 2608 KB Output isn't correct
29 Incorrect 52 ms 3408 KB Output isn't correct
30 Correct 36 ms 3148 KB Output is correct
31 Incorrect 39 ms 1612 KB Output isn't correct
32 Correct 50 ms 3140 KB Output is correct
33 Incorrect 49 ms 2516 KB Output isn't correct
34 Correct 31 ms 3168 KB Output is correct
35 Incorrect 41 ms 3308 KB Output isn't correct
36 Incorrect 48 ms 2636 KB Output isn't correct
37 Correct 52 ms 3072 KB Output is correct
38 Incorrect 57 ms 3356 KB Output isn't correct
39 Incorrect 50 ms 2892 KB Output isn't correct
40 Correct 36 ms 3236 KB Output is correct
41 Incorrect 44 ms 3240 KB Output isn't correct
42 Incorrect 47 ms 2636 KB Output isn't correct
43 Incorrect 68 ms 2812 KB Output isn't correct
44 Incorrect 63 ms 3440 KB Output isn't correct
45 Incorrect 48 ms 3240 KB Output isn't correct
46 Incorrect 60 ms 2952 KB Output isn't correct
47 Correct 61 ms 3232 KB Output is correct
48 Incorrect 52 ms 3352 KB Output isn't correct
49 Incorrect 58 ms 3044 KB Output isn't correct
50 Correct 35 ms 1996 KB Output is correct
51 Correct 64 ms 3276 KB Output is correct
52 Correct 56 ms 3228 KB Output is correct
53 Incorrect 53 ms 3276 KB Output isn't correct
54 Incorrect 52 ms 2676 KB Output isn't correct
55 Correct 61 ms 3224 KB Output is correct
56 Incorrect 51 ms 2680 KB Output isn't correct
57 Incorrect 57 ms 3268 KB Output isn't correct
58 Correct 62 ms 3252 KB Output is correct
59 Incorrect 50 ms 2788 KB Output isn't correct
60 Correct 46 ms 3180 KB Output is correct
61 Incorrect 51 ms 2380 KB Output isn't correct
62 Correct 45 ms 3180 KB Output is correct
63 Incorrect 50 ms 2756 KB Output isn't correct
64 Correct 40 ms 3288 KB Output is correct
65 Incorrect 41 ms 2288 KB Output isn't correct
66 Incorrect 65 ms 3240 KB Output isn't correct
67 Correct 51 ms 3252 KB Output is correct
68 Correct 45 ms 3220 KB Output is correct
69 Correct 53 ms 3236 KB Output is correct
70 Incorrect 42 ms 1836 KB Output isn't correct
71 Correct 50 ms 3216 KB Output is correct
72 Incorrect 45 ms 2508 KB Output isn't correct
73 Incorrect 53 ms 2900 KB Output isn't correct
74 Incorrect 28 ms 1636 KB Output isn't correct
75 Incorrect 41 ms 2384 KB Output isn't correct
76 Incorrect 13 ms 852 KB Output isn't correct
77 Incorrect 60 ms 3304 KB Output isn't correct
78 Incorrect 53 ms 2560 KB Output isn't correct
79 Incorrect 65 ms 2636 KB Output isn't correct
80 Incorrect 48 ms 3276 KB Output isn't correct
81 Incorrect 58 ms 3264 KB Output isn't correct
82 Correct 14 ms 3156 KB Output is correct
83 Correct 52 ms 3100 KB Output is correct
84 Incorrect 58 ms 3232 KB Output isn't correct
85 Incorrect 53 ms 2828 KB Output isn't correct
86 Correct 51 ms 2892 KB Output is correct
87 Correct 56 ms 3252 KB Output is correct
88 Incorrect 52 ms 2812 KB Output isn't correct
89 Incorrect 56 ms 3380 KB Output isn't correct
90 Incorrect 33 ms 1824 KB Output isn't correct
91 Incorrect 51 ms 3376 KB Output isn't correct
92 Correct 58 ms 3292 KB Output is correct
93 Incorrect 45 ms 2220 KB Output isn't correct
94 Correct 56 ms 2940 KB Output is correct
95 Correct 47 ms 3120 KB Output is correct
96 Incorrect 59 ms 3236 KB Output isn't correct
97 Correct 44 ms 2664 KB Output is correct
98 Correct 28 ms 1704 KB Output is correct
99 Incorrect 49 ms 2680 KB Output isn't correct
100 Correct 41 ms 1876 KB Output is correct
101 Incorrect 54 ms 2780 KB Output isn't correct
102 Correct 69 ms 3148 KB Output is correct