oj.uz

답안 #940405

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
940405 2024-03-07T08:55:29 Z vjudge1 미술 수업 (IOI13_artclass) C++17
9 / 100
 85 ms 10704 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);
}
 
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
  h=H;
  w=W;
  int C1=30;
  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];
  }
  {
    int ok=5;
    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++;
        }
      }
    }
    if(cnt<h*w*1.0/15)ok=0;
    // 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();
          queue<pii> q;
          q.push({i,j});
          use[i][j]=1;
          while(!q.empty()){
            int x=q.front().F,y=q.front().S;
            vec.pb({x,y});
            q.pop();
            use[x][y]=1;
            for(int k=0;k<8;k++){
              int nx=x+dx[k];
              int ny=y+dy[k];
              if(good(nx,ny)&&!isBorder[nx][ny]&&!use[nx][ny]){
                use[nx][ny]=1;
                q.push({nx,ny});
              }
            }
          }
          // 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;
          mr/=sz(vec);
          mb/=sz(vec);
          mg/=sz(vec);
          int cnt=0;
          for(auto x:vec){
            if(abs(R[x.F][x.S]-mr)<=C1*2&&abs(G[x.F][x.S]-mg)<=C1*2&&abs(B[x.F][x.S]-mb)<=C1*2)cnt++;
          }
          if(cnt<sz(vec)*9.0/10){
            ok--;
          }
        }
      }
    }
    if(ok>0)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;
  int cnt=0;
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      if(G[i][j]>=R[i][j]&&G[i][j]>=200&&B[i][j]<=100){
        cnt++;
      }
      if(R[i][j]>=200&&G[i][j]>=100&&G[i][j]<=200&&B[i][j]<=150){
        cnt++;
      }
    }
  }
  if(cnt>=H*W*8.0/10){
    return 2;
  }
  return 3;
}

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
9.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 54 ms 9348 KB Output isn't correct
2 Correct 25 ms 7536 KB Output is correct
3 Correct 71 ms 9416 KB Output is correct
4 Incorrect 45 ms 10180 KB Output isn't correct
5 Incorrect 51 ms 8148 KB Output isn't correct
6 Correct 37 ms 9440 KB Output is correct
7 Incorrect 48 ms 10188 KB Output isn't correct
8 Correct 34 ms 8912 KB Output is correct
9 Incorrect 50 ms 10464 KB Output isn't correct
10 Incorrect 45 ms 10444 KB Output isn't correct
11 Incorrect 61 ms 9444 KB Output isn't correct
12 Incorrect 43 ms 10192 KB Output isn't correct
13 Correct 29 ms 4700 KB Output is correct
14 Incorrect 31 ms 8868 KB Output isn't correct
15 Incorrect 47 ms 10704 KB Output isn't correct
16 Incorrect 29 ms 8660 KB Output isn't correct
17 Correct 35 ms 7780 KB Output is correct
18 Correct 51 ms 8932 KB Output is correct
19 Incorrect 50 ms 9164 KB Output isn't correct
20 Incorrect 64 ms 8916 KB Output isn't correct
21 Correct 46 ms 10204 KB Output is correct
22 Incorrect 66 ms 10448 KB Output isn't correct
23 Incorrect 39 ms 10440 KB Output isn't correct
24 Correct 57 ms 8908 KB Output is correct
25 Incorrect 40 ms 9164 KB Output isn't correct
26 Incorrect 46 ms 10464 KB Output isn't correct
27 Incorrect 49 ms 10184 KB Output isn't correct
28 Incorrect 44 ms 10704 KB Output isn't correct
29 Correct 43 ms 9428 KB Output is correct
30 Correct 53 ms 8532 KB Output is correct
31 Correct 50 ms 10640 KB Output is correct
32 Incorrect 37 ms 10460 KB Output isn't correct
33 Incorrect 70 ms 9184 KB Output isn't correct
34 Correct 46 ms 8916 KB Output is correct
35 Incorrect 46 ms 10456 KB Output isn't correct
36 Incorrect 48 ms 9892 KB Output isn't correct
37 Correct 28 ms 8428 KB Output is correct
38 Correct 55 ms 8912 KB Output is correct
39 Incorrect 25 ms 9680 KB Output isn't correct
40 Correct 59 ms 10648 KB Output is correct
41 Incorrect 68 ms 9952 KB Output isn't correct
42 Incorrect 70 ms 10440 KB Output isn't correct
43 Correct 41 ms 9448 KB Output is correct
44 Correct 40 ms 9680 KB Output is correct
45 Correct 30 ms 7760 KB Output is correct
46 Correct 13 ms 7000 KB Output is correct
47 Incorrect 42 ms 10452 KB Output isn't correct
48 Correct 31 ms 8648 KB Output is correct
49 Incorrect 53 ms 8916 KB Output isn't correct
50 Incorrect 44 ms 10440 KB Output isn't correct
51 Incorrect 51 ms 8916 KB Output isn't correct
52 Correct 70 ms 10444 KB Output is correct
53 Correct 56 ms 9932 KB Output is correct
54 Incorrect 57 ms 9592 KB Output isn't correct
55 Correct 42 ms 10692 KB Output is correct
56 Incorrect 49 ms 10436 KB Output isn't correct
57 Correct 49 ms 8528 KB Output is correct
58 Incorrect 43 ms 10184 KB Output isn't correct
59 Incorrect 56 ms 10436 KB Output isn't correct
60 Incorrect 42 ms 10436 KB Output isn't correct
61 Incorrect 52 ms 10436 KB Output isn't correct
62 Correct 49 ms 10652 KB Output is correct
63 Correct 54 ms 10460 KB Output is correct
64 Correct 46 ms 8532 KB Output is correct
65 Correct 71 ms 10440 KB Output is correct
66 Incorrect 58 ms 8932 KB Output isn't correct
67 Incorrect 46 ms 10184 KB Output isn't correct
68 Correct 53 ms 9440 KB Output is correct
69 Correct 43 ms 8908 KB Output is correct
70 Correct 52 ms 10204 KB Output is correct
71 Incorrect 46 ms 9160 KB Output isn't correct
72 Correct 49 ms 10704 KB Output is correct
73 Correct 44 ms 9448 KB Output is correct
74 Correct 35 ms 10460 KB Output is correct
75 Incorrect 48 ms 10184 KB Output isn't correct
76 Correct 37 ms 8848 KB Output is correct
77 Correct 32 ms 8660 KB Output is correct
78 Incorrect 48 ms 10196 KB Output isn't correct
79 Correct 43 ms 8040 KB Output is correct
80 Incorrect 48 ms 10184 KB Output isn't correct
81 Correct 48 ms 10440 KB Output is correct
82 Correct 43 ms 9128 KB Output is correct
83 Incorrect 40 ms 8652 KB Output isn't correct
84 Correct 46 ms 8864 KB Output is correct
85 Incorrect 38 ms 10524 KB Output isn't correct
86 Incorrect 55 ms 10464 KB Output isn't correct
87 Incorrect 43 ms 10192 KB Output isn't correct
88 Incorrect 85 ms 10444 KB Output isn't correct
89 Correct 36 ms 7248 KB Output is correct
90 Correct 56 ms 8908 KB Output is correct
91 Incorrect 40 ms 9164 KB Output isn't correct
92 Incorrect 55 ms 8792 KB Output isn't correct
93 Correct 59 ms 10460 KB Output is correct
94 Correct 47 ms 9048 KB Output is correct
95 Correct 41 ms 9940 KB Output is correct
96 Correct 39 ms 10436 KB Output is correct
97 Incorrect 11 ms 8284 KB Output isn't correct
98 Incorrect 46 ms 9420 KB Output isn't correct
99 Incorrect 50 ms 8912 KB Output isn't correct
100 Correct 57 ms 10196 KB Output is correct
101 Correct 52 ms 8908 KB Output is correct
102 Incorrect 65 ms 9424 KB Output isn't correct