oj.uz

답안 #573725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
573725 2022-06-07T05:55:34 Z Theo830 미술 수업 (IOI13_artclass) C++17
0 / 100
 117 ms 11212 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 + 3) / 4;
    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]}) <= 5){
                aspro++;
            }
        }
    }
    if(posa >= (ll)ex.size()){
         if(prasina >= posa){
            ans = 2;
         }
         else{
            ans = 3;
         }
    }
    else{
        if(aspro >= posa){
            ans = 1;
        }
        else{
            ans = 4;
        }
    }
    return ans;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 76 ms 9288 KB Output isn't correct
2 Incorrect 70 ms 7032 KB Output isn't correct
3 Incorrect 70 ms 7604 KB Output isn't correct
4 Incorrect 52 ms 6348 KB Output isn't correct
5 Incorrect 86 ms 9372 KB Output isn't correct
6 Incorrect 61 ms 5956 KB Output isn't correct
7 Incorrect 69 ms 5984 KB Output isn't correct
8 Incorrect 19 ms 2512 KB Output isn't correct
9 Incorrect 70 ms 6604 KB Output isn't correct
10 Incorrect 62 ms 6696 KB Output isn't correct
11 Incorrect 65 ms 6540 KB Output isn't correct
12 Incorrect 76 ms 8376 KB Output isn't correct
13 Incorrect 71 ms 7096 KB Output isn't correct
14 Incorrect 47 ms 5952 KB Output isn't correct
15 Incorrect 89 ms 9964 KB Output isn't correct
16 Incorrect 64 ms 7240 KB Output isn't correct
17 Incorrect 44 ms 5780 KB Output isn't correct
18 Incorrect 75 ms 7504 KB Output isn't correct
19 Incorrect 79 ms 8748 KB Output isn't correct
20 Incorrect 63 ms 5988 KB Output isn't correct
21 Incorrect 76 ms 6604 KB Output isn't correct
22 Incorrect 48 ms 4612 KB Output isn't correct
23 Incorrect 47 ms 6176 KB Output isn't correct
24 Incorrect 86 ms 9776 KB Output isn't correct
25 Incorrect 47 ms 5732 KB Output isn't correct
26 Incorrect 59 ms 6196 KB Output isn't correct
27 Incorrect 57 ms 6440 KB Output isn't correct
28 Incorrect 52 ms 5140 KB Output isn't correct
29 Incorrect 45 ms 5688 KB Output isn't correct
30 Incorrect 79 ms 8504 KB Output isn't correct
31 Incorrect 65 ms 6072 KB Output isn't correct
32 Incorrect 73 ms 6944 KB Output isn't correct
33 Incorrect 54 ms 5708 KB Output isn't correct
34 Incorrect 61 ms 6984 KB Output isn't correct
35 Incorrect 57 ms 7372 KB Output isn't correct
36 Incorrect 64 ms 8204 KB Output isn't correct
37 Incorrect 80 ms 9420 KB Output isn't correct
38 Incorrect 68 ms 6604 KB Output isn't correct
39 Incorrect 83 ms 9112 KB Output isn't correct
40 Incorrect 84 ms 8488 KB Output isn't correct
41 Incorrect 50 ms 6436 KB Output isn't correct
42 Incorrect 68 ms 6860 KB Output isn't correct
43 Incorrect 88 ms 8936 KB Output isn't correct
44 Incorrect 64 ms 6560 KB Output isn't correct
45 Incorrect 60 ms 6668 KB Output isn't correct
46 Incorrect 82 ms 9264 KB Output isn't correct
47 Incorrect 47 ms 5772 KB Output isn't correct
48 Incorrect 78 ms 8548 KB Output isn't correct
49 Incorrect 91 ms 7812 KB Output isn't correct
50 Incorrect 50 ms 5812 KB Output isn't correct
51 Incorrect 82 ms 6520 KB Output isn't correct
52 Incorrect 61 ms 7988 KB Output isn't correct
53 Incorrect 74 ms 9284 KB Output isn't correct
54 Incorrect 68 ms 6408 KB Output isn't correct
55 Incorrect 74 ms 6928 KB Output isn't correct
56 Incorrect 67 ms 8076 KB Output isn't correct
57 Incorrect 53 ms 5824 KB Output isn't correct
58 Incorrect 69 ms 7316 KB Output isn't correct
59 Incorrect 61 ms 7080 KB Output isn't correct
60 Incorrect 84 ms 9420 KB Output isn't correct
61 Incorrect 71 ms 7464 KB Output isn't correct
62 Incorrect 117 ms 11212 KB Output isn't correct
63 Incorrect 84 ms 9032 KB Output isn't correct
64 Incorrect 80 ms 7820 KB Output isn't correct
65 Incorrect 61 ms 5900 KB Output isn't correct
66 Incorrect 58 ms 6472 KB Output isn't correct
67 Incorrect 80 ms 8652 KB Output isn't correct
68 Incorrect 85 ms 9820 KB Output isn't correct
69 Incorrect 81 ms 8504 KB Output isn't correct
70 Incorrect 66 ms 7044 KB Output isn't correct
71 Incorrect 66 ms 6444 KB Output isn't correct
72 Incorrect 69 ms 8700 KB Output isn't correct
73 Incorrect 65 ms 8180 KB Output isn't correct
74 Incorrect 85 ms 8456 KB Output isn't correct
75 Incorrect 76 ms 7840 KB Output isn't correct
76 Incorrect 51 ms 5568 KB Output isn't correct
77 Incorrect 56 ms 5980 KB Output isn't correct
78 Incorrect 59 ms 6192 KB Output isn't correct
79 Incorrect 51 ms 5976 KB Output isn't correct
80 Incorrect 70 ms 6864 KB Output isn't correct
81 Incorrect 64 ms 7192 KB Output isn't correct
82 Incorrect 75 ms 8308 KB Output isn't correct
83 Incorrect 85 ms 10120 KB Output isn't correct
84 Incorrect 49 ms 5444 KB Output isn't correct
85 Incorrect 51 ms 5324 KB Output isn't correct
86 Incorrect 59 ms 5804 KB Output isn't correct
87 Incorrect 90 ms 10036 KB Output isn't correct
88 Incorrect 79 ms 8336 KB Output isn't correct
89 Incorrect 90 ms 8984 KB Output isn't correct
90 Incorrect 16 ms 3816 KB Output isn't correct
91 Incorrect 85 ms 9932 KB Output isn't correct
92 Incorrect 36 ms 5520 KB Output isn't correct
93 Correct 74 ms 6732 KB Output is correct
94 Incorrect 39 ms 4696 KB Output isn't correct
95 Incorrect 53 ms 5504 KB Output isn't correct
96 Correct 55 ms 5720 KB Output is correct
97 Correct 61 ms 5852 KB Output is correct
98 Incorrect 41 ms 5324 KB Output isn't correct
99 Incorrect 61 ms 6716 KB Output isn't correct
100 Incorrect 68 ms 6380 KB Output isn't correct
101 Incorrect 57 ms 6040 KB Output isn't correct
102 Incorrect 39 ms 4028 KB Output isn't correct