oj.uz

답안 #935124

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
935124 2024-02-28T17:14:51 Z anton 미술 수업 (IOI13_artclass) C++17
8 / 100
 53 ms 6484 KB 
#include "artclass.h"
#include<bits/stdc++.h>


using namespace std;
#define ll long long
#define pii pair<int, int>

struct pixel{
    pixel(){

    }
    int r, g, b;
    pixel(int a, int _b, int c){
        r=a;
        g=_b;
        b=c;
    }
    void add(pixel& rh){
        r += rh.r;
        b+=rh.b;
        g+=rh.g;
    }
    void round_pixel(int rond){
        r =(r/rond)*rond;
        g =(g/rond)*rond;
        b =(b/rond)*rond;
    }
    string to_s(){
        string res;
        res.push_back(r);
        res.push_back(g);
        res.push_back(b);
        return res;
    }
    void satur(){
        r += b+g;
        r/=3;
        b=r;
        g=r;
    }
};

const int comp = 40;

pixel img[500][500];
pixel img2[50][50];
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {

    unordered_map<string, int> m;
    for(int i = 0; i<H; i++){
        for(int j = 0; j<W; j++){
            img[i][j] = pixel(R[i][j], G[i][j], B[i][j]);
            img[i][j].round_pixel(40);
            img2[i/comp][j/comp].add(img[i][j]);
            //cout<<i/comp<<" "<<j/comp<<endl;
            m[img[i][j].to_s()]++;
        }
    }

    for(int i = 0; i<H/comp; i++){
        for(int j = 0; j<W/comp; j++){
            //cout<<i<<" "<<j<<endl;
            //cout<<img2[i][j].r<<" "<<img2[i][j].g<<" "<<img2[i][j].b<<endl;
            int h_left=  min(comp, H-(i*comp));
            int w_left=  min(comp, W-(j*comp));
            img2[i][j].r/=(h_left*w_left);
            img2[i][j].g/=(h_left*w_left);
            img2[i][j].b/=(h_left*w_left);
            //cout<<img2[i][j].r<<" "<<img2[i][j].g<<" "<<img2[i][j].b<<endl;
        }
    }

    vector<int> v;
    for(auto e: m){
        v.push_back(e.second);
    }

    sort(v.begin(), v.end());
    int mx=0;
    for(int i = 0; i<3; i++){
        mx+= v[v.size()-1-i];
    }

    double percentage = (double)(mx)/(double)(H*W);

    unordered_map<string, int> m2;
    for(int i = 0; i<H/comp; i++){
        for(int j = 0; j<W/comp; j++){
            img2[i][j].round_pixel(50);


            m2[img2[i][j].to_s()]++;
        }
    }

    vector<int> v2;
    for(auto e: m2){
        v2.push_back(e.second);
    }

    sort(v2.begin(), v2.end());
    int mx2=0;
    for(int i = 0; i<2; i++){
        mx2+= v2[v2.size()-1-i];
    }

    double percentage2 = (double)(mx2)/(double)((H/comp)*(W/comp));


    //cout<<v.size()<<endl;

    

    //cout<<percentage<<" "<<percentage2<<endl;


    if(percentage>0.5){
        if(percentage2 >0.4){
            return 4;
        }
        else{
            return 1;
        }
    }
    else{
        if(percentage2 >0.4){
            return 3;
        }
        else{
            return 2;
        }
    }
    
    /*ll s= 0.;
    for(int j = 0; j<W; j++){
        for(int i = 0; i<H-1; i++){
           s+=(R[j][i+1]-R[j][i])*(R[j][i+1]-R[j][i]) + (G[j][i+1]-G[j][i])*(G[j][i+1]-G[j][i]) + (B[j][i+1]-B[j][i])*(B[j][i+1]-B[j][i]);
        }
    }

    double avg = (double)(s)/((double)((H-1)*W));

    cout<<avg<<endl;*/
}

Subtask #1
8.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 29 ms 6224 KB Output isn't correct
2 Correct 31 ms 5200 KB Output is correct
3 Incorrect 39 ms 6256 KB Output isn't correct
4 Correct 38 ms 6220 KB Output is correct
5 Correct 38 ms 6228 KB Output is correct
6 Correct 38 ms 5712 KB Output is correct
7 Correct 39 ms 6220 KB Output is correct
8 Incorrect 40 ms 5964 KB Output isn't correct
9 Correct 40 ms 6224 KB Output is correct
10 Incorrect 37 ms 6224 KB Output isn't correct
11 Correct 30 ms 4944 KB Output is correct
12 Correct 36 ms 6244 KB Output is correct
13 Correct 52 ms 5968 KB Output is correct
14 Incorrect 37 ms 5716 KB Output isn't correct
15 Correct 41 ms 6240 KB Output is correct
16 Incorrect 43 ms 6236 KB Output isn't correct
17 Incorrect 49 ms 6484 KB Output isn't correct
18 Incorrect 37 ms 6220 KB Output isn't correct
19 Incorrect 30 ms 5200 KB Output isn't correct
20 Incorrect 31 ms 6132 KB Output isn't correct
21 Incorrect 26 ms 5212 KB Output isn't correct
22 Incorrect 34 ms 5456 KB Output isn't correct
23 Incorrect 41 ms 6476 KB Output isn't correct
24 Incorrect 38 ms 5472 KB Output isn't correct
25 Incorrect 23 ms 4700 KB Output isn't correct
26 Incorrect 35 ms 5480 KB Output isn't correct
27 Incorrect 42 ms 5708 KB Output isn't correct
28 Correct 28 ms 4696 KB Output is correct
29 Incorrect 35 ms 5472 KB Output isn't correct
30 Correct 38 ms 5452 KB Output is correct
31 Incorrect 37 ms 5428 KB Output isn't correct
32 Incorrect 32 ms 6224 KB Output isn't correct
33 Incorrect 38 ms 6224 KB Output isn't correct
34 Correct 28 ms 6236 KB Output is correct
35 Correct 36 ms 6220 KB Output is correct
36 Incorrect 41 ms 5716 KB Output isn't correct
37 Correct 38 ms 6224 KB Output is correct
38 Correct 40 ms 6224 KB Output is correct
39 Incorrect 48 ms 6220 KB Output isn't correct
40 Incorrect 46 ms 6224 KB Output isn't correct
41 Correct 43 ms 6224 KB Output is correct
42 Incorrect 34 ms 6232 KB Output isn't correct
43 Incorrect 29 ms 6236 KB Output isn't correct
44 Correct 32 ms 5212 KB Output is correct
45 Correct 32 ms 6232 KB Output is correct
46 Correct 47 ms 6228 KB Output is correct
47 Incorrect 47 ms 6224 KB Output isn't correct
48 Incorrect 38 ms 5712 KB Output isn't correct
49 Incorrect 43 ms 6224 KB Output isn't correct
50 Correct 40 ms 6220 KB Output is correct
51 Correct 30 ms 4700 KB Output is correct
52 Correct 44 ms 6128 KB Output is correct
53 Incorrect 47 ms 6224 KB Output isn't correct
54 Incorrect 37 ms 6224 KB Output isn't correct
55 Correct 23 ms 4696 KB Output is correct
56 Correct 36 ms 6236 KB Output is correct
57 Incorrect 23 ms 6236 KB Output isn't correct
58 Incorrect 39 ms 5724 KB Output isn't correct
59 Incorrect 39 ms 5716 KB Output isn't correct
60 Correct 43 ms 6176 KB Output is correct
61 Correct 29 ms 6224 KB Output is correct
62 Incorrect 46 ms 6236 KB Output isn't correct
63 Correct 31 ms 5224 KB Output is correct
64 Correct 42 ms 5724 KB Output is correct
65 Incorrect 40 ms 5712 KB Output isn't correct
66 Correct 36 ms 5468 KB Output is correct
67 Correct 26 ms 4696 KB Output is correct
68 Correct 38 ms 5468 KB Output is correct
69 Incorrect 50 ms 6200 KB Output isn't correct
70 Incorrect 46 ms 6224 KB Output isn't correct
71 Incorrect 38 ms 6244 KB Output isn't correct
72 Incorrect 47 ms 6224 KB Output isn't correct
73 Correct 32 ms 6220 KB Output is correct
74 Incorrect 35 ms 5456 KB Output isn't correct
75 Correct 29 ms 6236 KB Output is correct
76 Incorrect 35 ms 5456 KB Output isn't correct
77 Correct 34 ms 6224 KB Output is correct
78 Correct 39 ms 6280 KB Output is correct
79 Correct 37 ms 6228 KB Output is correct
80 Correct 45 ms 5964 KB Output is correct
81 Correct 20 ms 4700 KB Output is correct
82 Correct 32 ms 6224 KB Output is correct
83 Correct 39 ms 5736 KB Output is correct
84 Incorrect 47 ms 6224 KB Output isn't correct
85 Incorrect 46 ms 6236 KB Output isn't correct
86 Correct 11 ms 5976 KB Output is correct
87 Incorrect 40 ms 6480 KB Output isn't correct
88 Incorrect 37 ms 5468 KB Output isn't correct
89 Incorrect 39 ms 5724 KB Output isn't correct
90 Incorrect 37 ms 6244 KB Output isn't correct
91 Incorrect 44 ms 5712 KB Output isn't correct
92 Correct 46 ms 6240 KB Output is correct
93 Correct 11 ms 4696 KB Output is correct
94 Correct 44 ms 5608 KB Output is correct
95 Incorrect 26 ms 6224 KB Output isn't correct
96 Incorrect 53 ms 6224 KB Output isn't correct
97 Incorrect 44 ms 6228 KB Output isn't correct
98 Correct 37 ms 6228 KB Output is correct
99 Incorrect 37 ms 5460 KB Output isn't correct
100 Correct 20 ms 4712 KB Output is correct
101 Incorrect 44 ms 5712 KB Output isn't correct
102 Correct 40 ms 6224 KB Output is correct