| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1108217 | whatthemomooofun1729 | 미술 수업 (IOI13_artclass) | C++17 | 57 ms | 6992 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <sstream>
#include <chrono>
#include <random>
#define ff first
#define ss second
#define PB push_back
#define sz(x) int(x.size())
#define rsz resize
#define fch(xxx, yyy) for (auto xxx : yyy) // abusive notation
#define all(x) (x).begin(),(x).end()
#define eps 1e-9
// more abusive notation (use at your own risk):
// #define int ll
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
// debugging
void __print(int x) {std::cerr << x;}
void __print(ll x) {std::cerr << x;} /* remember to uncomment this when not using THE MACRO */
void __print(unsigned x) {std::cerr << x;}
void __print(ull x) {std::cerr << x;}
void __print(float x) {std::cerr << x;}
void __print(double x) {std::cerr << x;}
void __print(ld x) {std::cerr << x;}
void __print(char x) {std::cerr << '\'' << x << '\'';}
void __print(const char *x) {std::cerr << '\"' << x << '\"';}
void __print(const string& x) {std::cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {std::cerr << '{'; __print(x.ff); std::cerr << ", "; __print(x.ss); std::cerr << '}';}
template<typename T> void __print(const T& x) {int f = 0; std::cerr << '{'; for (auto &i: x) std::cerr << (f++ ? ", " : ""), __print(i); std::cerr << "}";}
void _print() {std::cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) std::cerr << ", "; _print(v...);}
void println() {std::cerr << ">--------------------<" << endl;}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// templates
template <class T> bool ckmin(T &a, const T &b) {return b<a ? a = b, 1 : 0;}
template <class T> bool ckmax(T &a, const T &b) {return b>a ? a = b, 1 : 0;}
template <class T> using gr = greater<T>;
template <class T> using vc = vector<T>;
template <class T> using p_q = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vc<T>, gr<T>>;
template <class T1, class T2> using pr = pair<T1, T2>;
mt19937_64 rng_ll(chrono::steady_clock::now().time_since_epoch().count());
int rng(int M) {return (int)(rng_ll()%M);} /*returns any random number in [0, M) */
// const variables
constexpr int INF = (int)2e9;
constexpr int MOD = 998244353;
constexpr long double EPS = (ld)1e-10, PI = 3.1415926535;
constexpr ll LL_INF = (ll)3e18;
constexpr int mod = (int)1e9 + 7;
constexpr ll inverse = 500000004LL; // inverse of 2 modulo 1e9 + 7
void setIO(const string& str) {// fast input/output
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
if (str.empty()) return;
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
#include "artclass.h"
int xDir[4] = { 0, 1, 0, -1};
int yDir[4] = { 1, 0, -1, 0};
int C = 1;
int vst[500][500];
int similar(int r1, int g1, int b1, int r2, int g2, int b2) {
int dist = (r2 - r1) * (r2 - r1) + (g2 - g1) * (g2 - g1) + (b2 - b1) * (b2 - b1);
return dist <= 900;
}
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
double mr = 0.00, mg = 0.00, mb = 0.00;
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
mr += R[i][j], mg += G[i][j], mb += B[i][j];
if (vst[i][j] == 0) {
queue<pii> q;
q.push({i, j});
while (!q.empty()) {
int x = q.front().ff, y = q.front().ss;
q.pop();
for (int k = 0; k < 4; ++k) {
int nx = x + xDir[k], ny = y + yDir[k];
if (nx < 0 || nx > H || ny < 0 || ny > W) continue;
if (vst[nx][ny] == 0 && similar(R[x][y], G[x][y], B[x][y], R[nx][ny], G[nx][ny], B[nx][ny])) {
vst[nx][ny] = C;
q.push({nx, ny});
}
}
}
C++;
}
}
}
C--;
debug(C);
if (C > 12000) return 3;
else if (C > 2500) {
if (C > 5000) return 2;
mr/=(H * W);
mg/=(H * W);
mb/=(H * W);
double stdev = 0.00;
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
stdev += (R[i][j] - mr) * (R[i][j] - mr) + (G[i][j] - mg) * (G[i][j] - mg) + (B[i][j] - mb) * (B[i][j] - mb);
}
}
stdev/=(H * W);
debug(stdev);
if (stdev > 10000) return 1;
else return 2;
}
else if (C > 80) return 1;
else return 4;
}
/*
int r[500][500], g[500][500], b[500][500];
signed main() { // TIME YOURSELF !!!
setIO("");
int h, w;
cin >> h >> w;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
cin >> r[i][j] >> g[i][j] >> b[i][j];
}
}
cout << style(h, w, r, g, b);
return 0;
}*/
// TLE -> TRY NOT USING DEFINE INT LONG LONG
// CE -> CHECK LINE 45
// 5000 * 5000 size matrices are kinda big (potential mle)
// Do something, start simpler
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||