oj.uz

답안 #919411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
919411 2024-01-31T17:48:44 Z hariaakas646 벽 칠하기 (APIO20_paint) C++17
100 / 100
 855 ms 408992 KB 
#include "paint.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, l, r) for(int i=l; i<r; i++)
#define frange(i, l) forr(i, 0, l)
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
 
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef long long lli;
typedef vector<vi> vvi;
typedef vector<lli> vll;
typedef vector<bool> vb;
typedef set<int> seti;
typedef multiset<int> mseti;

int minimumInstructions(
    int n, int m, int k, vector<int> col,
    vector<int> cnt, vector<std::vector<int>> fav) {

    // vector<vb> favb(m, vb(k));
    if(k <= 1e4) {vector<vector<short>> val(k);
    
        frange(i, fav.size()) {
            for(auto e : fav[i]) {
                val[e].pb(i);
            }
        }
    
    
        vector<vector<short>> dp1(n), dp2(n);
        if(val[col[0]].size() >= 1 && val[col[0]][0] == 0) dp1[0].pb(0);
    
        forr(i, 1, n) {
            int id = 0;
            while(id < val[col[i]].size() && val[col[i]][id] < 0) id++;
            if(id < val[col[i]].size() && val[col[i]][id] == 0) dp1[i].pb(0);
            for(auto e : dp1[i-1]) {
                while(id < val[col[i]].size() && val[col[i]][id] < e+1) id++;
                if(id < val[col[i]].size() && val[col[i]][id] == e+1) dp1[i].pb(e+1);
            }
        }
    
        if(val[col[n-1]].size() && val[col[n-1]].back() == m-1) dp2[n-1].pb(m-1);
    
        for(int i=n-2; i>=0; i--) {
            int id = 0;
            for(auto e : dp2[i+1]) {
                while(id < val[col[i]].size() && val[col[i]][id] < e-1) id++;
                if(id < val[col[i]].size() && val[col[i]][id] == e-1) dp2[i].pb(e-1);
            }
            while(id < val[col[i]].size() && val[col[i]][id] < m-1) id++;
            if(id < val[col[i]].size() && val[col[i]][id] == m-1) dp2[i].pb(m-1);
        }
    
        vb pos(n);
    
        forr(i, m-1, n) {
            int id = 0;
            for(auto e : dp1[i]) {
                while(id < dp2[i-m+1].size() && dp2[i-m+1][id] < e+1) id++;
                if(id < dp2[i-m+1].size() && dp2[i-m+1][id] == e+1) pos[i] = true;
            }
            
            if(dp1[i].size() && dp1[i].back() == m-1) pos[i] = true;
            if(dp2[i-m+1].size() && dp2[i-m+1].front() == 0) pos[i] = true;
        }
    
        vi dp(n, 1e9);
    
        if(pos[m-1]) dp[m-1] = 1;
    
        deque<int> dq;
        dq.pb(m-1);
    
        forr(i, m, n) {
            while(dq.size() && dq.front() < i-m) dq.pop_front();
            if(pos[i]) {
                if(dq.size())
                    dp[i] = min(dp[i], dp[dq.front()]+1);
                while(dq.size() && dp[dq.back()] >= dp[i]) dq.pop_back();
                dq.pb(i);
            }
        }
        if(dp[n-1] >= 1e9) return -1;
        else return dp[n-1];}
    else {vector<vector<int>> val(k);
    
        frange(i, fav.size()) {
            for(auto e : fav[i]) {
                val[e].pb(i);
            }
        }
    
    
        vector<vector<int>> dp1(n), dp2(n);
        if(val[col[0]].size() >= 1 && val[col[0]][0] == 0) dp1[0].pb(0);
    
        forr(i, 1, n) {
            int id = 0;
            while(id < val[col[i]].size() && val[col[i]][id] < 0) id++;
            if(id < val[col[i]].size() && val[col[i]][id] == 0) dp1[i].pb(0);
            for(auto e : dp1[i-1]) {
                while(id < val[col[i]].size() && val[col[i]][id] < e+1) id++;
                if(id < val[col[i]].size() && val[col[i]][id] == e+1) dp1[i].pb(e+1);
            }
        }
    
        if(val[col[n-1]].size() && val[col[n-1]].back() == m-1) dp2[n-1].pb(m-1);
    
        for(int i=n-2; i>=0; i--) {
            int id = 0;
            for(auto e : dp2[i+1]) {
                while(id < val[col[i]].size() && val[col[i]][id] < e-1) id++;
                if(id < val[col[i]].size() && val[col[i]][id] == e-1) dp2[i].pb(e-1);
            }
            while(id < val[col[i]].size() && val[col[i]][id] < m-1) id++;
            if(id < val[col[i]].size() && val[col[i]][id] == m-1) dp2[i].pb(m-1);
        }
    
        vb pos(n);
    
        forr(i, m-1, n) {
            int id = 0;
            for(auto e : dp1[i]) {
                while(id < dp2[i-m+1].size() && dp2[i-m+1][id] < e+1) id++;
                if(id < dp2[i-m+1].size() && dp2[i-m+1][id] == e+1) pos[i] = true;
            }
            
            if(dp1[i].size() && dp1[i].back() == m-1) pos[i] = true;
            if(dp2[i-m+1].size() && dp2[i-m+1].front() == 0) pos[i] = true;
        }
    
        vi dp(n, 1e9);
    
        if(pos[m-1]) dp[m-1] = 1;
    
        deque<int> dq;
        dq.pb(m-1);
    
        forr(i, m, n) {
            while(dq.size() && dq.front() < i-m) dq.pop_front();
            if(pos[i]) {
                if(dq.size())
                    dp[i] = min(dp[i], dp[dq.front()]+1);
                while(dq.size() && dp[dq.back()] >= dp[i]) dq.pop_back();
                dq.pb(i);
            }
        }
        if(dp[n-1] >= 1e9) return -1;
        else return dp[n-1];}
}

Compilation message

paint.cpp: In function 'int minimumInstructions(int, int, int, std::vector<int>, std::vector<int>, std::vector<std::vector<int> >)':
paint.cpp:8:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define forr(i, l, r) for(int i=l; i<r; i++)
      |                                     ^
paint.cpp:9:22: note: in expansion of macro 'forr'
    9 | #define frange(i, l) forr(i, 0, l)
      |                      ^~~~
paint.cpp:33:9: note: in expansion of macro 'frange'
   33 |         frange(i, fav.size()) {
      |         ^~~~~~
paint.cpp:45:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |             while(id < val[col[i]].size() && val[col[i]][id] < 0) id++;
      |                   ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:46:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |             if(id < val[col[i]].size() && val[col[i]][id] == 0) dp1[i].pb(0);
      |                ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:48:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |                 while(id < val[col[i]].size() && val[col[i]][id] < e+1) id++;
      |                       ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:49:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |                 if(id < val[col[i]].size() && val[col[i]][id] == e+1) dp1[i].pb(e+1);
      |                    ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:58:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |                 while(id < val[col[i]].size() && val[col[i]][id] < e-1) id++;
      |                       ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:59:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |                 if(id < val[col[i]].size() && val[col[i]][id] == e-1) dp2[i].pb(e-1);
      |                    ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:61:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |             while(id < val[col[i]].size() && val[col[i]][id] < m-1) id++;
      |                   ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:62:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             if(id < val[col[i]].size() && val[col[i]][id] == m-1) dp2[i].pb(m-1);
      |                ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:70:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |                 while(id < dp2[i-m+1].size() && dp2[i-m+1][id] < e+1) id++;
      |                       ~~~^~~~~~~~~~~~~~~~~~~
paint.cpp:71:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |                 if(id < dp2[i-m+1].size() && dp2[i-m+1][id] == e+1) pos[i] = true;
      |                    ~~~^~~~~~~~~~~~~~~~~~~
paint.cpp:8:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define forr(i, l, r) for(int i=l; i<r; i++)
      |                                     ^
paint.cpp:9:22: note: in expansion of macro 'forr'
    9 | #define frange(i, l) forr(i, 0, l)
      |                      ^~~~
paint.cpp:98:9: note: in expansion of macro 'frange'
   98 |         frange(i, fav.size()) {
      |         ^~~~~~
paint.cpp:110:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |             while(id < val[col[i]].size() && val[col[i]][id] < 0) id++;
      |                   ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:111:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |             if(id < val[col[i]].size() && val[col[i]][id] == 0) dp1[i].pb(0);
      |                ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:113:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |                 while(id < val[col[i]].size() && val[col[i]][id] < e+1) id++;
      |                       ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:114:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |                 if(id < val[col[i]].size() && val[col[i]][id] == e+1) dp1[i].pb(e+1);
      |                    ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:123:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |                 while(id < val[col[i]].size() && val[col[i]][id] < e-1) id++;
      |                       ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:124:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |                 if(id < val[col[i]].size() && val[col[i]][id] == e-1) dp2[i].pb(e-1);
      |                    ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:126:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  126 |             while(id < val[col[i]].size() && val[col[i]][id] < m-1) id++;
      |                   ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:127:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |             if(id < val[col[i]].size() && val[col[i]][id] == m-1) dp2[i].pb(m-1);
      |                ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:135:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |                 while(id < dp2[i-m+1].size() && dp2[i-m+1][id] < e+1) id++;
      |                       ~~~^~~~~~~~~~~~~~~~~~~
paint.cpp:136:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  136 |                 if(id < dp2[i-m+1].size() && dp2[i-m+1][id] == e+1) pos[i] = true;
      |                    ~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 2 ms 2648 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2648 KB Output is correct
18 Correct 2 ms 2648 KB Output is correct
19 Correct 1 ms 2648 KB Output is correct
20 Correct 3 ms 2652 KB Output is correct
21 Correct 2 ms 2648 KB Output is correct
22 Correct 14 ms 6744 KB Output is correct
23 Correct 16 ms 6744 KB Output is correct
24 Correct 22 ms 6620 KB Output is correct
25 Correct 7 ms 2656 KB Output is correct
26 Correct 4 ms 2648 KB Output is correct
27 Correct 5 ms 2392 KB Output is correct
28 Correct 4 ms 2136 KB Output is correct
29 Correct 4 ms 1880 KB Output is correct
30 Correct 3 ms 1880 KB Output is correct
31 Correct 10 ms 5976 KB Output is correct
32 Correct 10 ms 5980 KB Output is correct
33 Correct 12 ms 5976 KB Output is correct
34 Correct 10 ms 6132 KB Output is correct
35 Correct 10 ms 5976 KB Output is correct
36 Correct 9 ms 5976 KB Output is correct
37 Correct 18 ms 8024 KB Output is correct
38 Correct 17 ms 7876 KB Output is correct
39 Correct 21 ms 8024 KB Output is correct
40 Correct 24 ms 11352 KB Output is correct
41 Correct 14 ms 7260 KB Output is correct
42 Correct 22 ms 10840 KB Output is correct
43 Correct 12 ms 6232 KB Output is correct
44 Correct 9 ms 4952 KB Output is correct
45 Correct 14 ms 7772 KB Output is correct
46 Correct 49 ms 20404 KB Output is correct
47 Correct 35 ms 12808 KB Output is correct
48 Correct 27 ms 14424 KB Output is correct
49 Correct 32 ms 13132 KB Output is correct
50 Correct 29 ms 13136 KB Output is correct
51 Correct 25 ms 10832 KB Output is correct
52 Correct 23 ms 12376 KB Output is correct
53 Correct 23 ms 12624 KB Output is correct
54 Correct 22 ms 10840 KB Output is correct
55 Correct 17 ms 9304 KB Output is correct
56 Correct 15 ms 8264 KB Output is correct
57 Correct 17 ms 7768 KB Output is correct
58 Correct 52 ms 22136 KB Output is correct
59 Correct 47 ms 22108 KB Output is correct
60 Correct 49 ms 22364 KB Output is correct
61 Correct 65 ms 22128 KB Output is correct
62 Correct 51 ms 22352 KB Output is correct
63 Correct 57 ms 22128 KB Output is correct
64 Correct 46 ms 16704 KB Output is correct
65 Correct 50 ms 16776 KB Output is correct
66 Correct 39 ms 16888 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 2 ms 2648 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2648 KB Output is correct
18 Correct 2 ms 2648 KB Output is correct
19 Correct 1 ms 2648 KB Output is correct
20 Correct 3 ms 2652 KB Output is correct
21 Correct 2 ms 2648 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 2 ms 2392 KB Output is correct
34 Correct 2 ms 1880 KB Output is correct
35 Correct 1 ms 1624 KB Output is correct
36 Correct 2 ms 2648 KB Output is correct
37 Correct 1 ms 2136 KB Output is correct
38 Correct 2 ms 2392 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 2 ms 2136 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 2 ms 2652 KB Output is correct
43 Correct 1 ms 2648 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 2 ms 2648 KB Output is correct
51 Correct 1 ms 2648 KB Output is correct
52 Correct 2 ms 2648 KB Output is correct
53 Correct 2 ms 2648 KB Output is correct
54 Correct 2 ms 2648 KB Output is correct
55 Correct 2 ms 2648 KB Output is correct
56 Correct 2 ms 2648 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 2652 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 2 ms 2652 KB Output is correct
61 Correct 1 ms 344 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2648 KB Output is correct
17 Correct 2 ms 2648 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2648 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 1 ms 2648 KB Output is correct
22 Correct 3 ms 2652 KB Output is correct
23 Correct 2 ms 2648 KB Output is correct
24 Correct 14 ms 6744 KB Output is correct
25 Correct 16 ms 6744 KB Output is correct
26 Correct 22 ms 6620 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 2 ms 2392 KB Output is correct
37 Correct 2 ms 1880 KB Output is correct
38 Correct 1 ms 1624 KB Output is correct
39 Correct 2 ms 2648 KB Output is correct
40 Correct 1 ms 2136 KB Output is correct
41 Correct 2 ms 2392 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 2 ms 2136 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 2 ms 2652 KB Output is correct
46 Correct 1 ms 2648 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 2 ms 2648 KB Output is correct
54 Correct 1 ms 2648 KB Output is correct
55 Correct 2 ms 2648 KB Output is correct
56 Correct 2 ms 2648 KB Output is correct
57 Correct 2 ms 2648 KB Output is correct
58 Correct 2 ms 2648 KB Output is correct
59 Correct 2 ms 2648 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 1 ms 2652 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 2 ms 2652 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 1 ms 600 KB Output is correct
66 Correct 1 ms 344 KB Output is correct
67 Correct 2 ms 600 KB Output is correct
68 Correct 2 ms 604 KB Output is correct
69 Correct 2 ms 600 KB Output is correct
70 Correct 3 ms 2648 KB Output is correct
71 Correct 3 ms 2136 KB Output is correct
72 Correct 3 ms 2136 KB Output is correct
73 Correct 2 ms 2136 KB Output is correct
74 Correct 3 ms 2396 KB Output is correct
75 Correct 3 ms 2904 KB Output is correct
76 Correct 15 ms 4700 KB Output is correct
77 Correct 15 ms 5464 KB Output is correct
78 Correct 27 ms 6220 KB Output is correct
79 Correct 2 ms 856 KB Output is correct
80 Correct 2 ms 856 KB Output is correct
81 Correct 2 ms 856 KB Output is correct
82 Correct 2 ms 856 KB Output is correct
83 Correct 3 ms 856 KB Output is correct
84 Correct 4 ms 2908 KB Output is correct
85 Correct 5 ms 2904 KB Output is correct
86 Correct 3 ms 2908 KB Output is correct
87 Correct 4 ms 2904 KB Output is correct
88 Correct 3 ms 2908 KB Output is correct
89 Correct 6 ms 2908 KB Output is correct
90 Correct 22 ms 6620 KB Output is correct
91 Correct 26 ms 6484 KB Output is correct
92 Correct 26 ms 6748 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2648 KB Output is correct
17 Correct 2 ms 2648 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2648 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 1 ms 2648 KB Output is correct
22 Correct 3 ms 2652 KB Output is correct
23 Correct 2 ms 2648 KB Output is correct
24 Correct 14 ms 6744 KB Output is correct
25 Correct 16 ms 6744 KB Output is correct
26 Correct 22 ms 6620 KB Output is correct
27 Correct 7 ms 2656 KB Output is correct
28 Correct 4 ms 2648 KB Output is correct
29 Correct 5 ms 2392 KB Output is correct
30 Correct 4 ms 2136 KB Output is correct
31 Correct 4 ms 1880 KB Output is correct
32 Correct 3 ms 1880 KB Output is correct
33 Correct 10 ms 5976 KB Output is correct
34 Correct 10 ms 5980 KB Output is correct
35 Correct 12 ms 5976 KB Output is correct
36 Correct 10 ms 6132 KB Output is correct
37 Correct 10 ms 5976 KB Output is correct
38 Correct 9 ms 5976 KB Output is correct
39 Correct 18 ms 8024 KB Output is correct
40 Correct 17 ms 7876 KB Output is correct
41 Correct 21 ms 8024 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 2 ms 2392 KB Output is correct
52 Correct 2 ms 1880 KB Output is correct
53 Correct 1 ms 1624 KB Output is correct
54 Correct 2 ms 2648 KB Output is correct
55 Correct 1 ms 2136 KB Output is correct
56 Correct 2 ms 2392 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 2 ms 2136 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 2 ms 2652 KB Output is correct
61 Correct 1 ms 2648 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 2 ms 2648 KB Output is correct
69 Correct 1 ms 2648 KB Output is correct
70 Correct 2 ms 2648 KB Output is correct
71 Correct 2 ms 2648 KB Output is correct
72 Correct 2 ms 2648 KB Output is correct
73 Correct 2 ms 2648 KB Output is correct
74 Correct 2 ms 2648 KB Output is correct
75 Correct 1 ms 348 KB Output is correct
76 Correct 1 ms 2652 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 2 ms 2652 KB Output is correct
79 Correct 1 ms 344 KB Output is correct
80 Correct 1 ms 600 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Correct 2 ms 600 KB Output is correct
83 Correct 2 ms 604 KB Output is correct
84 Correct 2 ms 600 KB Output is correct
85 Correct 3 ms 2648 KB Output is correct
86 Correct 3 ms 2136 KB Output is correct
87 Correct 3 ms 2136 KB Output is correct
88 Correct 2 ms 2136 KB Output is correct
89 Correct 3 ms 2396 KB Output is correct
90 Correct 3 ms 2904 KB Output is correct
91 Correct 15 ms 4700 KB Output is correct
92 Correct 15 ms 5464 KB Output is correct
93 Correct 27 ms 6220 KB Output is correct
94 Correct 2 ms 856 KB Output is correct
95 Correct 2 ms 856 KB Output is correct
96 Correct 2 ms 856 KB Output is correct
97 Correct 2 ms 856 KB Output is correct
98 Correct 3 ms 856 KB Output is correct
99 Correct 4 ms 2908 KB Output is correct
100 Correct 5 ms 2904 KB Output is correct
101 Correct 3 ms 2908 KB Output is correct
102 Correct 4 ms 2904 KB Output is correct
103 Correct 3 ms 2908 KB Output is correct
104 Correct 6 ms 2908 KB Output is correct
105 Correct 22 ms 6620 KB Output is correct
106 Correct 26 ms 6484 KB Output is correct
107 Correct 26 ms 6748 KB Output is correct
108 Correct 7 ms 2652 KB Output is correct
109 Correct 173 ms 58652 KB Output is correct
110 Correct 7 ms 1632 KB Output is correct
111 Correct 6 ms 1376 KB Output is correct
112 Correct 6 ms 1884 KB Output is correct
113 Correct 7 ms 1368 KB Output is correct
114 Correct 12 ms 5464 KB Output is correct
115 Correct 14 ms 5208 KB Output is correct
116 Correct 16 ms 6492 KB Output is correct
117 Correct 14 ms 4696 KB Output is correct
118 Correct 14 ms 5720 KB Output is correct
119 Correct 13 ms 5464 KB Output is correct
120 Correct 21 ms 5464 KB Output is correct
121 Correct 7 ms 2652 KB Output is correct
122 Correct 23 ms 5468 KB Output is correct
123 Correct 6 ms 2392 KB Output is correct
124 Correct 25 ms 6996 KB Output is correct
125 Correct 14 ms 3732 KB Output is correct
126 Correct 11 ms 4188 KB Output is correct
127 Correct 10 ms 5208 KB Output is correct
128 Correct 7 ms 4188 KB Output is correct
129 Correct 7 ms 3932 KB Output is correct
130 Correct 7 ms 2904 KB Output is correct
131 Correct 210 ms 81060 KB Output is correct
132 Correct 18 ms 2904 KB Output is correct
133 Correct 8 ms 2344 KB Output is correct
134 Correct 7 ms 2136 KB Output is correct
135 Correct 7 ms 2088 KB Output is correct
136 Correct 28 ms 6992 KB Output is correct
137 Correct 23 ms 7004 KB Output is correct
138 Correct 19 ms 7000 KB Output is correct
139 Correct 17 ms 6936 KB Output is correct
140 Correct 22 ms 6928 KB Output is correct
141 Correct 24 ms 6992 KB Output is correct
142 Correct 25 ms 8536 KB Output is correct
143 Correct 9 ms 4192 KB Output is correct
144 Correct 25 ms 8544 KB Output is correct
145 Correct 8 ms 4184 KB Output is correct
146 Correct 26 ms 8536 KB Output is correct
147 Correct 15 ms 4184 KB Output is correct
148 Correct 10 ms 5976 KB Output is correct
149 Correct 9 ms 5812 KB Output is correct
150 Correct 11 ms 5980 KB Output is correct
151 Correct 12 ms 5980 KB Output is correct

Subtask #5
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2648 KB Output is correct
17 Correct 2 ms 2648 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2648 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 1 ms 2648 KB Output is correct
22 Correct 3 ms 2652 KB Output is correct
23 Correct 2 ms 2648 KB Output is correct
24 Correct 14 ms 6744 KB Output is correct
25 Correct 16 ms 6744 KB Output is correct
26 Correct 22 ms 6620 KB Output is correct
27 Correct 7 ms 2656 KB Output is correct
28 Correct 4 ms 2648 KB Output is correct
29 Correct 5 ms 2392 KB Output is correct
30 Correct 4 ms 2136 KB Output is correct
31 Correct 4 ms 1880 KB Output is correct
32 Correct 3 ms 1880 KB Output is correct
33 Correct 10 ms 5976 KB Output is correct
34 Correct 10 ms 5980 KB Output is correct
35 Correct 12 ms 5976 KB Output is correct
36 Correct 10 ms 6132 KB Output is correct
37 Correct 10 ms 5976 KB Output is correct
38 Correct 9 ms 5976 KB Output is correct
39 Correct 18 ms 8024 KB Output is correct
40 Correct 17 ms 7876 KB Output is correct
41 Correct 21 ms 8024 KB Output is correct
42 Correct 24 ms 11352 KB Output is correct
43 Correct 14 ms 7260 KB Output is correct
44 Correct 22 ms 10840 KB Output is correct
45 Correct 12 ms 6232 KB Output is correct
46 Correct 9 ms 4952 KB Output is correct
47 Correct 14 ms 7772 KB Output is correct
48 Correct 49 ms 20404 KB Output is correct
49 Correct 35 ms 12808 KB Output is correct
50 Correct 27 ms 14424 KB Output is correct
51 Correct 32 ms 13132 KB Output is correct
52 Correct 29 ms 13136 KB Output is correct
53 Correct 25 ms 10832 KB Output is correct
54 Correct 23 ms 12376 KB Output is correct
55 Correct 23 ms 12624 KB Output is correct
56 Correct 22 ms 10840 KB Output is correct
57 Correct 17 ms 9304 KB Output is correct
58 Correct 15 ms 8264 KB Output is correct
59 Correct 17 ms 7768 KB Output is correct
60 Correct 52 ms 22136 KB Output is correct
61 Correct 47 ms 22108 KB Output is correct
62 Correct 49 ms 22364 KB Output is correct
63 Correct 65 ms 22128 KB Output is correct
64 Correct 51 ms 22352 KB Output is correct
65 Correct 57 ms 22128 KB Output is correct
66 Correct 46 ms 16704 KB Output is correct
67 Correct 50 ms 16776 KB Output is correct
68 Correct 39 ms 16888 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 1 ms 344 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 1 ms 348 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 1 ms 344 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 1 ms 344 KB Output is correct
78 Correct 2 ms 2392 KB Output is correct
79 Correct 2 ms 1880 KB Output is correct
80 Correct 1 ms 1624 KB Output is correct
81 Correct 2 ms 2648 KB Output is correct
82 Correct 1 ms 2136 KB Output is correct
83 Correct 2 ms 2392 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 2 ms 2136 KB Output is correct
86 Correct 1 ms 348 KB Output is correct
87 Correct 2 ms 2652 KB Output is correct
88 Correct 1 ms 2648 KB Output is correct
89 Correct 1 ms 344 KB Output is correct
90 Correct 1 ms 348 KB Output is correct
91 Correct 1 ms 344 KB Output is correct
92 Correct 1 ms 344 KB Output is correct
93 Correct 1 ms 348 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 2 ms 2648 KB Output is correct
96 Correct 1 ms 2648 KB Output is correct
97 Correct 2 ms 2648 KB Output is correct
98 Correct 2 ms 2648 KB Output is correct
99 Correct 2 ms 2648 KB Output is correct
100 Correct 2 ms 2648 KB Output is correct
101 Correct 2 ms 2648 KB Output is correct
102 Correct 1 ms 348 KB Output is correct
103 Correct 1 ms 2652 KB Output is correct
104 Correct 1 ms 348 KB Output is correct
105 Correct 2 ms 2652 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 1 ms 600 KB Output is correct
108 Correct 1 ms 344 KB Output is correct
109 Correct 2 ms 600 KB Output is correct
110 Correct 2 ms 604 KB Output is correct
111 Correct 2 ms 600 KB Output is correct
112 Correct 3 ms 2648 KB Output is correct
113 Correct 3 ms 2136 KB Output is correct
114 Correct 3 ms 2136 KB Output is correct
115 Correct 2 ms 2136 KB Output is correct
116 Correct 3 ms 2396 KB Output is correct
117 Correct 3 ms 2904 KB Output is correct
118 Correct 15 ms 4700 KB Output is correct
119 Correct 15 ms 5464 KB Output is correct
120 Correct 27 ms 6220 KB Output is correct
121 Correct 2 ms 856 KB Output is correct
122 Correct 2 ms 856 KB Output is correct
123 Correct 2 ms 856 KB Output is correct
124 Correct 2 ms 856 KB Output is correct
125 Correct 3 ms 856 KB Output is correct
126 Correct 4 ms 2908 KB Output is correct
127 Correct 5 ms 2904 KB Output is correct
128 Correct 3 ms 2908 KB Output is correct
129 Correct 4 ms 2904 KB Output is correct
130 Correct 3 ms 2908 KB Output is correct
131 Correct 6 ms 2908 KB Output is correct
132 Correct 22 ms 6620 KB Output is correct
133 Correct 26 ms 6484 KB Output is correct
134 Correct 26 ms 6748 KB Output is correct
135 Correct 7 ms 2652 KB Output is correct
136 Correct 173 ms 58652 KB Output is correct
137 Correct 7 ms 1632 KB Output is correct
138 Correct 6 ms 1376 KB Output is correct
139 Correct 6 ms 1884 KB Output is correct
140 Correct 7 ms 1368 KB Output is correct
141 Correct 12 ms 5464 KB Output is correct
142 Correct 14 ms 5208 KB Output is correct
143 Correct 16 ms 6492 KB Output is correct
144 Correct 14 ms 4696 KB Output is correct
145 Correct 14 ms 5720 KB Output is correct
146 Correct 13 ms 5464 KB Output is correct
147 Correct 21 ms 5464 KB Output is correct
148 Correct 7 ms 2652 KB Output is correct
149 Correct 23 ms 5468 KB Output is correct
150 Correct 6 ms 2392 KB Output is correct
151 Correct 25 ms 6996 KB Output is correct
152 Correct 14 ms 3732 KB Output is correct
153 Correct 11 ms 4188 KB Output is correct
154 Correct 10 ms 5208 KB Output is correct
155 Correct 7 ms 4188 KB Output is correct
156 Correct 7 ms 3932 KB Output is correct
157 Correct 7 ms 2904 KB Output is correct
158 Correct 210 ms 81060 KB Output is correct
159 Correct 18 ms 2904 KB Output is correct
160 Correct 8 ms 2344 KB Output is correct
161 Correct 7 ms 2136 KB Output is correct
162 Correct 7 ms 2088 KB Output is correct
163 Correct 28 ms 6992 KB Output is correct
164 Correct 23 ms 7004 KB Output is correct
165 Correct 19 ms 7000 KB Output is correct
166 Correct 17 ms 6936 KB Output is correct
167 Correct 22 ms 6928 KB Output is correct
168 Correct 24 ms 6992 KB Output is correct
169 Correct 25 ms 8536 KB Output is correct
170 Correct 9 ms 4192 KB Output is correct
171 Correct 25 ms 8544 KB Output is correct
172 Correct 8 ms 4184 KB Output is correct
173 Correct 26 ms 8536 KB Output is correct
174 Correct 15 ms 4184 KB Output is correct
175 Correct 10 ms 5976 KB Output is correct
176 Correct 9 ms 5812 KB Output is correct
177 Correct 11 ms 5980 KB Output is correct
178 Correct 12 ms 5980 KB Output is correct
179 Correct 19 ms 8016 KB Output is correct
180 Correct 348 ms 108908 KB Output is correct
181 Correct 40 ms 9044 KB Output is correct
182 Correct 60 ms 10144 KB Output is correct
183 Correct 19 ms 5720 KB Output is correct
184 Correct 16 ms 5208 KB Output is correct
185 Correct 31 ms 11584 KB Output is correct
186 Correct 33 ms 14344 KB Output is correct
187 Correct 41 ms 13648 KB Output is correct
188 Correct 26 ms 11104 KB Output is correct
189 Correct 46 ms 16564 KB Output is correct
190 Correct 33 ms 11088 KB Output is correct
191 Correct 40 ms 15332 KB Output is correct
192 Correct 22 ms 9048 KB Output is correct
193 Correct 34 ms 12564 KB Output is correct
194 Correct 30 ms 12636 KB Output is correct
195 Correct 855 ms 408992 KB Output is correct
196 Correct 46 ms 10308 KB Output is correct
197 Correct 38 ms 9812 KB Output is correct
198 Correct 33 ms 8276 KB Output is correct
199 Correct 48 ms 8020 KB Output is correct
200 Correct 98 ms 24044 KB Output is correct
201 Correct 63 ms 25428 KB Output is correct
202 Correct 68 ms 25428 KB Output is correct
203 Correct 86 ms 24712 KB Output is correct
204 Correct 68 ms 24784 KB Output is correct
205 Correct 119 ms 25300 KB Output is correct
206 Correct 48 ms 18260 KB Output is correct
207 Correct 61 ms 22208 KB Output is correct
208 Correct 64 ms 18260 KB Output is correct
209 Correct 54 ms 22440 KB Output is correct
210 Correct 69 ms 18260 KB Output is correct
211 Correct 49 ms 22364 KB Output is correct
212 Correct 95 ms 23256 KB Output is correct
213 Correct 70 ms 19780 KB Output is correct
214 Correct 68 ms 20028 KB Output is correct
215 Correct 82 ms 19708 KB Output is correct