oj.uz

Submission #962153

# Submission time Handle Problem Language Result Execution time Memory
962153 2024-04-13T07:56:29 Z Ice_man Art Class (IOI13_artclass) C++14
100 / 100
 53 ms 8024 KB 
/**
 ____    ____    ____    __________________    ____    ____    ____
||I ||  ||c ||  ||e ||  ||                ||  ||M ||  ||a ||  ||n ||
||__||  ||__||  ||__||  ||________________||  ||__||  ||__||  ||__||
|/__\|  |/__\|  |/__\|  |/________________\|  |/__\|  |/__\|  |/__\|

*/

#include"artclass.h"
#include <iostream>
#include <chrono>
#include <vector>
#include <algorithm>
#include <cstdio>

#define maxn 2000005
#define maxlog 20
#define INF 1000000010
#define LINF 1000000000000000005
#define endl '\n'
#define pb(x) push_back(x)
#define X first
#define Y second
#define control cerr<<"passed"<<endl;

#pragma GCC optimize("O3" , "Ofast" , "unroll-loops" , "fast-math")
#pragma GCC target("avx2")

using namespace std;

/**std::chrono::high_resolution_clock::time_point startT, currT;
constexpr double TIME_MULT = 1;

double timePassed()
{
    using namespace std::chrono;
    currT = high_resolution_clock::now();
    double time = duration_cast<duration<double>>(currT - startT).count();
    return time * TIME_MULT;
}*/



int r[500][500], g[500][500], b[500][500];
int br = 0;

int sum(int i1, int j1, int i2, int j2)
{
    br++;
    int _r = abs(r[i1][j1] - r[i2][j2]);
    int _g = abs(g[i1][j1] - g[i2][j2]);
    int _b = abs(b[i1][j1] - b[i2][j2]);

    return _r + _g + _b;
}

int h, w;


int style(int H, int W, int R[500][500], int G[500][500], int B[500][500])
{
    h = H;
    w = W;

    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];
        }

    /**cin >> h >> w;

    for(int i = 0; i < h; i++)
        for(int j = 0; j < w; j++)
        {
            cin >> r[i][j];
            cin >> g[i][j];
            cin >> b[i][j];
        }*/


    long long res = 0; // 191250000

    for(int i = 0; i < h; i++)
        for(int j = 0; j < w; j++)
        {
            if(i >= 1)
                res += sum(i, j, i - 1, j);

            if(j >= 1)
                res += sum(i, j, i, j - 1);

            if(i >= 1 && j >= 1)
                res += sum(i, j, i - 1, j - 1);
        }

    res /= br;
    ///cout << res << endl;

    if(res <= 9)
        return 4;
    if(res <= 26)
        return 1;
    if(res <= 59)
        return 2;
    return 3;
}








/**int main()
{

#ifdef ONLINE_JUDGE /// promeni
    freopen("input.in", "r", stdin);
    ///freopen("taxi.out", "w", stdout);
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    //startT = std::chrono::high_resolution_clock::now();

    style();


    return 0;
}*/

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 7508 KB Output is correct
2 Incorrect 36 ms 7512 KB Output isn't correct
3 Correct 35 ms 7508 KB Output is correct
4 Correct 29 ms 7504 KB Output is correct
5 Correct 28 ms 7252 KB Output is correct
6 Correct 31 ms 7304 KB Output is correct
7 Correct 36 ms 7504 KB Output is correct
8 Correct 44 ms 7764 KB Output is correct
9 Correct 39 ms 7508 KB Output is correct
10 Correct 36 ms 7512 KB Output is correct
11 Correct 40 ms 6984 KB Output is correct
12 Correct 37 ms 7248 KB Output is correct
13 Correct 45 ms 7880 KB Output is correct
14 Correct 38 ms 7508 KB Output is correct
15 Incorrect 46 ms 7504 KB Output isn't correct
16 Correct 38 ms 7380 KB Output is correct
17 Incorrect 44 ms 7804 KB Output isn't correct
18 Correct 33 ms 7004 KB Output is correct
19 Correct 47 ms 7764 KB Output is correct
20 Correct 28 ms 7248 KB Output is correct
21 Correct 41 ms 7764 KB Output is correct
22 Correct 36 ms 6992 KB Output is correct
23 Correct 34 ms 7012 KB Output is correct
24 Correct 11 ms 6764 KB Output is correct
25 Correct 44 ms 8024 KB Output is correct
26 Correct 28 ms 7268 KB Output is correct
27 Correct 35 ms 7508 KB Output is correct
28 Correct 24 ms 5984 KB Output is correct
29 Correct 33 ms 7352 KB Output is correct
30 Correct 21 ms 7004 KB Output is correct
31 Correct 23 ms 6232 KB Output is correct
32 Correct 40 ms 7468 KB Output is correct
33 Correct 35 ms 7488 KB Output is correct
34 Incorrect 34 ms 7504 KB Output isn't correct
35 Correct 38 ms 7512 KB Output is correct
36 Correct 44 ms 7504 KB Output is correct
37 Correct 27 ms 7252 KB Output is correct
38 Incorrect 33 ms 6508 KB Output isn't correct
39 Correct 34 ms 7244 KB Output is correct
40 Correct 36 ms 7524 KB Output is correct
41 Correct 9 ms 5212 KB Output is correct
42 Correct 34 ms 7016 KB Output is correct
43 Correct 30 ms 7508 KB Output is correct
44 Incorrect 33 ms 6736 KB Output isn't correct
45 Correct 25 ms 6256 KB Output is correct
46 Correct 39 ms 7012 KB Output is correct
47 Correct 18 ms 5724 KB Output is correct
48 Correct 35 ms 6996 KB Output is correct
49 Correct 34 ms 6756 KB Output is correct
50 Correct 36 ms 6996 KB Output is correct
51 Correct 33 ms 6992 KB Output is correct
52 Correct 32 ms 6736 KB Output is correct
53 Correct 38 ms 7248 KB Output is correct
54 Correct 27 ms 6488 KB Output is correct
55 Correct 44 ms 7664 KB Output is correct
56 Correct 35 ms 7004 KB Output is correct
57 Correct 39 ms 7444 KB Output is correct
58 Correct 43 ms 7812 KB Output is correct
59 Incorrect 36 ms 7004 KB Output isn't correct
60 Correct 23 ms 6332 KB Output is correct
61 Correct 36 ms 7008 KB Output is correct
62 Correct 31 ms 6740 KB Output is correct
63 Correct 36 ms 7504 KB Output is correct
64 Correct 34 ms 7136 KB Output is correct
65 Correct 23 ms 6244 KB Output is correct
66 Correct 37 ms 6628 KB Output is correct
67 Correct 20 ms 5724 KB Output is correct
68 Correct 38 ms 7216 KB Output is correct
69 Correct 41 ms 7756 KB Output is correct
70 Correct 38 ms 7096 KB Output is correct
71 Incorrect 47 ms 7756 KB Output isn't correct
72 Correct 36 ms 7516 KB Output is correct
73 Correct 35 ms 7508 KB Output is correct
74 Correct 39 ms 7248 KB Output is correct
75 Incorrect 43 ms 7700 KB Output isn't correct
76 Correct 33 ms 6748 KB Output is correct
77 Correct 37 ms 7532 KB Output is correct
78 Incorrect 30 ms 7516 KB Output isn't correct
79 Correct 35 ms 7516 KB Output is correct
80 Correct 39 ms 7724 KB Output is correct
81 Correct 36 ms 7000 KB Output is correct
82 Correct 33 ms 7516 KB Output is correct
83 Correct 44 ms 7764 KB Output is correct
84 Correct 27 ms 6492 KB Output is correct
85 Correct 38 ms 7256 KB Output is correct
86 Correct 27 ms 7128 KB Output is correct
87 Correct 27 ms 7248 KB Output is correct
88 Correct 27 ms 7264 KB Output is correct
89 Correct 20 ms 5736 KB Output is correct
90 Correct 48 ms 7760 KB Output is correct
91 Correct 25 ms 7268 KB Output is correct
92 Correct 43 ms 7504 KB Output is correct
93 Correct 38 ms 7504 KB Output is correct
94 Correct 26 ms 7248 KB Output is correct
95 Correct 53 ms 7688 KB Output is correct
96 Correct 34 ms 6740 KB Output is correct
97 Correct 43 ms 7772 KB Output is correct
98 Correct 45 ms 7764 KB Output is correct
99 Correct 34 ms 7516 KB Output is correct
100 Correct 28 ms 6612 KB Output is correct
101 Correct 38 ms 7512 KB Output is correct
102 Correct 40 ms 7756 KB Output is correct