oj.uz

답안 #940363

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
940363 2024-03-07T08:31:57 Z shenfe1 미술 수업 (IOI13_artclass) C++17
0 / 100
 90 ms 32820 KB 
#include <bits/stdc++.h>

#pragma optimize("Ofast")
#pragma target("avx2")

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
// #define int ll

const int MAX=500+15;
const ll inf=1e9;  
const int mod=1e9+7;
const int mod1=1e9+9;
const ld eps=1e-9;

int dx[8]={1,0,-1,0,1,-1,-1,1};
int dy[8]={0,1,0,-1,1,-1,1,-1};

int binpow(int a,int n){
  if(!n)return 1;
  if(n%2==1)return a*binpow(a,n-1);
  int k=binpow(a,n/2);
  return k*k;
}

#include "artclass.h"

int r[MAX][MAX],g[MAX][MAX],b[MAX][MAX];
int isBorder[MAX][MAX];
int h,w;
vector<pii> vec;
int use[MAX][MAX];

bool good(int i,int j){
  return (0<=i&&i<h&&0<=j&&j<w);
}

void dfs(int i,int j){
  // cout<<i<<" "<<j<<"\n";
  vec.pb({i,j});
  use[i][j]=1;
  for(int k=0;k<8;k++){
    int ni=i+dx[k];
    int nj=j+dy[k];
    if(good(ni,nj)&&!isBorder[ni][nj]&&!use[ni][nj])dfs(ni,nj);
  }
}

int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
  h=H;
  w=W;
  int C1=20;
  for(int i=0;i<h;i++)for(int j=0;j<w;j++){
    r[i][j]=R[i][j];
    g[i][j]=G[i][j];
    b[i][j]=B[i][j];
  }
  {
    bool ok=1;
    int cnt=0;
    for(int i=0;i<h;i++){
      for(int j=0;j<w;j++){
        if(abs(max({R[i][j],G[i][j],B[i][j]})-min({R[i][j],G[i][j],B[i][j]}))<=C1&&max({R[i][j],G[i][j],B[i][j]})<=128){
          isBorder[i][j]=1;
          cnt++;
        }
      }
    }
    // cout<<cnt<<"\n";
    for(int i=0;i<h;i++){
      for(int j=0;j<w;j++){
        if(!isBorder[i][j]&&!use[i][j]){
          vec.clear();
          dfs(i,j);
          // return -1;
          ld mr=0,mb=0,mg=0;          
          for(auto x:vec){
            mr+=R[x.F][x.S];
            mb+=B[x.F][x.S];
            mg+=G[x.F][x.S];
          }
          if(vec.empty())continue;
          cout<<sz(vec)<<"\n";
          mr/=sz(vec);
          mb/=sz(vec);
          mg/=sz(vec);
          int cnt=0;
          for(auto x:vec){
            if(abs(R[x.F][x.S]-mr)<=2*C1||abs(G[x.F][x.S]-mg)<=2*C1||abs(B[x.F][x.S]-mb)<=2*C1)cnt++;
          }
          if(cnt<sz(vec)*9.0/10){
            ok=0;
            // cout<<sz(vec)<<"\n";
          }
        }
      }
    }
    if(ok)return 1;
  }
  bool is4=1;
  int C=50;
  for(int i=0;i<H;i++){
    int cnt=0;
    ld mr=0,mb=0,mg=0;
    for(int j=0;j<W;j++){
      mr+=R[i][j];
      mb+=B[i][j];
      mg+=G[i][j];
    }
    mr/=W;
    mb/=W;
    mg/=W;
    for(int j=0;j<W;j++){
      if(abs(R[i][j]-mr)<=C&&abs(G[i][j]-mg)<=C&&abs(B[i][j]-mb)<=C)cnt++;
    }
    if(cnt<W*9.0/10){
      is4=0;
    }
  }
  if(is4==1)return 4;
  return 2;
}

Compilation message

artclass.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize("Ofast")
      | 
artclass.cpp:4: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    4 | #pragma target("avx2")
      |

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 51 ms 24512 KB Output isn't correct
2 Incorrect 50 ms 13008 KB Output isn't correct
3 Incorrect 70 ms 24516 KB Output isn't correct
4 Incorrect 45 ms 21956 KB Output isn't correct
5 Incorrect 23 ms 7636 KB Output isn't correct
6 Incorrect 61 ms 20932 KB Output isn't correct
7 Incorrect 66 ms 21652 KB Output isn't correct
8 Incorrect 53 ms 13768 KB Output isn't correct
9 Incorrect 52 ms 27568 KB Output isn't correct
10 Incorrect 57 ms 25024 KB Output isn't correct
11 Incorrect 90 ms 32820 KB Output isn't correct
12 Incorrect 50 ms 17468 KB Output isn't correct
13 Incorrect 32 ms 14544 KB Output isn't correct
14 Incorrect 55 ms 17864 KB Output isn't correct
15 Incorrect 72 ms 18852 KB Output isn't correct
16 Incorrect 35 ms 18724 KB Output isn't correct
17 Incorrect 52 ms 22700 KB Output isn't correct
18 Incorrect 33 ms 17092 KB Output isn't correct
19 Incorrect 39 ms 19920 KB Output isn't correct
20 Incorrect 60 ms 20936 KB Output isn't correct
21 Incorrect 42 ms 17608 KB Output isn't correct
22 Incorrect 63 ms 16836 KB Output isn't correct
23 Incorrect 50 ms 19128 KB Output isn't correct
24 Incorrect 50 ms 22336 KB Output isn't correct
25 Incorrect 54 ms 15308 KB Output isn't correct
26 Incorrect 53 ms 17356 KB Output isn't correct
27 Incorrect 76 ms 29240 KB Output isn't correct
28 Incorrect 51 ms 18632 KB Output isn't correct
29 Incorrect 28 ms 9656 KB Output isn't correct
30 Incorrect 49 ms 14536 KB Output isn't correct
31 Incorrect 78 ms 28484 KB Output isn't correct
32 Incorrect 60 ms 19652 KB Output isn't correct
33 Incorrect 17 ms 8028 KB Output isn't correct
34 Incorrect 40 ms 20424 KB Output isn't correct
35 Incorrect 61 ms 24068 KB Output isn't correct
36 Incorrect 42 ms 10072 KB Output isn't correct
37 Incorrect 38 ms 15056 KB Output isn't correct
38 Incorrect 45 ms 22976 KB Output isn't correct
39 Incorrect 52 ms 27188 KB Output isn't correct
40 Incorrect 12 ms 9024 KB Output isn't correct
41 Incorrect 46 ms 16072 KB Output isn't correct
42 Incorrect 53 ms 25284 KB Output isn't correct
43 Incorrect 44 ms 19656 KB Output isn't correct
44 Incorrect 44 ms 17828 KB Output isn't correct
45 Incorrect 30 ms 17360 KB Output isn't correct
46 Incorrect 63 ms 17760 KB Output isn't correct
47 Incorrect 72 ms 30276 KB Output isn't correct
48 Incorrect 57 ms 18372 KB Output isn't correct
49 Incorrect 52 ms 22464 KB Output isn't correct
50 Incorrect 52 ms 27068 KB Output isn't correct
51 Incorrect 56 ms 25792 KB Output isn't correct
52 Incorrect 43 ms 13764 KB Output isn't correct
53 Incorrect 55 ms 19144 KB Output isn't correct
54 Incorrect 47 ms 21956 KB Output isn't correct
55 Incorrect 55 ms 29296 KB Output isn't correct
56 Incorrect 44 ms 17860 KB Output isn't correct
57 Incorrect 54 ms 24236 KB Output isn't correct
58 Incorrect 45 ms 22468 KB Output isn't correct
59 Incorrect 42 ms 14536 KB Output isn't correct
60 Incorrect 56 ms 26564 KB Output isn't correct
61 Incorrect 45 ms 18888 KB Output isn't correct
62 Incorrect 56 ms 13776 KB Output isn't correct
63 Incorrect 55 ms 21260 KB Output isn't correct
64 Incorrect 30 ms 13012 KB Output isn't correct
65 Incorrect 58 ms 26816 KB Output isn't correct
66 Incorrect 64 ms 27324 KB Output isn't correct
67 Incorrect 23 ms 8796 KB Output isn't correct
68 Incorrect 42 ms 15448 KB Output isn't correct
69 Incorrect 52 ms 13252 KB Output isn't correct
70 Incorrect 54 ms 13012 KB Output isn't correct
71 Incorrect 63 ms 16076 KB Output isn't correct
72 Incorrect 41 ms 10076 KB Output isn't correct
73 Incorrect 61 ms 25276 KB Output isn't correct
74 Incorrect 63 ms 27304 KB Output isn't correct
75 Incorrect 46 ms 24256 KB Output isn't correct
76 Incorrect 63 ms 18104 KB Output isn't correct
77 Incorrect 56 ms 24932 KB Output isn't correct
78 Incorrect 64 ms 16584 KB Output isn't correct
79 Incorrect 39 ms 22216 KB Output isn't correct
80 Incorrect 77 ms 31260 KB Output isn't correct
81 Incorrect 77 ms 25536 KB Output isn't correct
82 Incorrect 67 ms 21444 KB Output isn't correct
83 Incorrect 54 ms 21544 KB Output isn't correct
84 Incorrect 56 ms 19912 KB Output isn't correct
85 Incorrect 52 ms 28352 KB Output isn't correct
86 Incorrect 52 ms 26304 KB Output isn't correct
87 Incorrect 60 ms 19144 KB Output isn't correct
88 Incorrect 50 ms 13776 KB Output isn't correct
89 Incorrect 62 ms 19396 KB Output isn't correct
90 Incorrect 33 ms 14284 KB Output isn't correct
91 Incorrect 45 ms 12280 KB Output isn't correct
92 Incorrect 45 ms 23844 KB Output isn't correct
93 Incorrect 53 ms 18888 KB Output isn't correct
94 Incorrect 61 ms 26304 KB Output isn't correct
95 Incorrect 50 ms 24752 KB Output isn't correct
96 Incorrect 31 ms 10060 KB Output isn't correct
97 Incorrect 46 ms 20420 KB Output isn't correct
98 Incorrect 43 ms 14500 KB Output isn't correct
99 Incorrect 55 ms 19860 KB Output isn't correct
100 Incorrect 54 ms 15780 KB Output isn't correct
101 Incorrect 38 ms 18124 KB Output isn't correct
102 Incorrect 38 ms 16840 KB Output isn't correct