oj.uz

Submission #398767

# Submission time Handle Problem Language Result Execution time Memory
398767 2021-05-04T19:42:49 Z duality Rope (JOI17_rope) C++11
100 / 100
 890 ms 109600 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

int C[1000000];
int ans[1000000],occ[1000000],order[1000000];
vi pos[1000000],adj[1000000];
int sub[1000000];
int main() {
    int i;
    int N,M;
    scanf("%d %d",&N,&M);
    for (i = 0; i < N; i++) scanf("%d",&C[i]),C[i]--;
    if (M == 1) {
        printf("0\n");
        return 0;
    }

    int j,t = 0;
    for (i = 0; i < M; i++) ans[i] = N;
    for (i = 0; i < N; i++) occ[C[i]]++;
    for (i = 0; i < M; i++) pos[occ[i]].pb(i);
    for (i = N-1; i >= 0; i--) {
        for (j = 0; j < pos[i].size(); j++) order[t++] = pos[i][j];
    }
    for (t = 0; t < 2; t++) {
        for (i = t; i+1 < N; i += 2) {
            adj[C[i]].pb(C[i+1]);
            adj[C[i+1]].pb(C[i]);
        }
        for (i = 0; i < M; i++) {
            for (j = 0; j < adj[i].size(); j++) sub[adj[i][j]]++;
            for (j = 0; j < M; j++) {
                int u = order[j];
                if (i != u) ans[i] = min(ans[i],N-occ[i]-occ[u]+sub[u]);
                if ((i != u) && (sub[u] == 0)) break;
            }
            for (j = 0; j < adj[i].size(); j++) sub[adj[i][j]] = 0;
            adj[i].clear();
        }
    }
    for (i = 0; i < M; i++) printf("%d\n",ans[i]);

    return 0;
}

Compilation message

rope.cpp: In function 'int main()':
rope.cpp:77:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |         for (j = 0; j < pos[i].size(); j++) order[t++] = pos[i][j];
      |                     ~~^~~~~~~~~~~~~~~
rope.cpp:85:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |             for (j = 0; j < adj[i].size(); j++) sub[adj[i][j]]++;
      |                         ~~^~~~~~~~~~~~~~~
rope.cpp:91:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |             for (j = 0; j < adj[i].size(); j++) sub[adj[i][j]] = 0;
      |                         ~~^~~~~~~~~~~~~~~
rope.cpp:65:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   65 |     scanf("%d %d",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~
rope.cpp:66:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   66 |     for (i = 0; i < N; i++) scanf("%d",&C[i]),C[i]--;
      |                             ~~~~~^~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47244 KB Output is correct
2 Correct 26 ms 47288 KB Output is correct
3 Correct 25 ms 47288 KB Output is correct
4 Correct 26 ms 47204 KB Output is correct
5 Correct 30 ms 47288 KB Output is correct
6 Correct 26 ms 47308 KB Output is correct
7 Correct 27 ms 47216 KB Output is correct
8 Correct 30 ms 47308 KB Output is correct
9 Correct 34 ms 47224 KB Output is correct
10 Correct 26 ms 47264 KB Output is correct
11 Correct 26 ms 47252 KB Output is correct
12 Correct 24 ms 47292 KB Output is correct
13 Correct 27 ms 47200 KB Output is correct
14 Correct 29 ms 47276 KB Output is correct
15 Correct 27 ms 47308 KB Output is correct
16 Correct 25 ms 47244 KB Output is correct
17 Correct 29 ms 47248 KB Output is correct
18 Correct 25 ms 47308 KB Output is correct
19 Correct 29 ms 47264 KB Output is correct
20 Correct 29 ms 47280 KB Output is correct
21 Correct 28 ms 47296 KB Output is correct
22 Correct 29 ms 47180 KB Output is correct
23 Correct 30 ms 47212 KB Output is correct
24 Correct 29 ms 47164 KB Output is correct
25 Correct 28 ms 47188 KB Output is correct
26 Correct 31 ms 47252 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47244 KB Output is correct
2 Correct 26 ms 47288 KB Output is correct
3 Correct 25 ms 47288 KB Output is correct
4 Correct 26 ms 47204 KB Output is correct
5 Correct 30 ms 47288 KB Output is correct
6 Correct 26 ms 47308 KB Output is correct
7 Correct 27 ms 47216 KB Output is correct
8 Correct 30 ms 47308 KB Output is correct
9 Correct 34 ms 47224 KB Output is correct
10 Correct 26 ms 47264 KB Output is correct
11 Correct 26 ms 47252 KB Output is correct
12 Correct 24 ms 47292 KB Output is correct
13 Correct 27 ms 47200 KB Output is correct
14 Correct 29 ms 47276 KB Output is correct
15 Correct 27 ms 47308 KB Output is correct
16 Correct 25 ms 47244 KB Output is correct
17 Correct 29 ms 47248 KB Output is correct
18 Correct 25 ms 47308 KB Output is correct
19 Correct 29 ms 47264 KB Output is correct
20 Correct 29 ms 47280 KB Output is correct
21 Correct 28 ms 47296 KB Output is correct
22 Correct 29 ms 47180 KB Output is correct
23 Correct 30 ms 47212 KB Output is correct
24 Correct 29 ms 47164 KB Output is correct
25 Correct 28 ms 47188 KB Output is correct
26 Correct 31 ms 47252 KB Output is correct
27 Correct 43 ms 48444 KB Output is correct
28 Correct 41 ms 48360 KB Output is correct
29 Correct 41 ms 48488 KB Output is correct
30 Correct 42 ms 48480 KB Output is correct
31 Correct 43 ms 48476 KB Output is correct
32 Correct 42 ms 48480 KB Output is correct
33 Correct 42 ms 48412 KB Output is correct
34 Correct 41 ms 48552 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47244 KB Output is correct
2 Correct 26 ms 47288 KB Output is correct
3 Correct 25 ms 47288 KB Output is correct
4 Correct 26 ms 47204 KB Output is correct
5 Correct 30 ms 47288 KB Output is correct
6 Correct 26 ms 47308 KB Output is correct
7 Correct 27 ms 47216 KB Output is correct
8 Correct 30 ms 47308 KB Output is correct
9 Correct 34 ms 47224 KB Output is correct
10 Correct 26 ms 47264 KB Output is correct
11 Correct 26 ms 47252 KB Output is correct
12 Correct 24 ms 47292 KB Output is correct
13 Correct 27 ms 47200 KB Output is correct
14 Correct 29 ms 47276 KB Output is correct
15 Correct 27 ms 47308 KB Output is correct
16 Correct 25 ms 47244 KB Output is correct
17 Correct 29 ms 47248 KB Output is correct
18 Correct 25 ms 47308 KB Output is correct
19 Correct 29 ms 47264 KB Output is correct
20 Correct 29 ms 47280 KB Output is correct
21 Correct 28 ms 47296 KB Output is correct
22 Correct 29 ms 47180 KB Output is correct
23 Correct 30 ms 47212 KB Output is correct
24 Correct 29 ms 47164 KB Output is correct
25 Correct 28 ms 47188 KB Output is correct
26 Correct 31 ms 47252 KB Output is correct
27 Correct 43 ms 48444 KB Output is correct
28 Correct 41 ms 48360 KB Output is correct
29 Correct 41 ms 48488 KB Output is correct
30 Correct 42 ms 48480 KB Output is correct
31 Correct 43 ms 48476 KB Output is correct
32 Correct 42 ms 48480 KB Output is correct
33 Correct 42 ms 48412 KB Output is correct
34 Correct 41 ms 48552 KB Output is correct
35 Correct 43 ms 48452 KB Output is correct
36 Correct 42 ms 48580 KB Output is correct
37 Correct 44 ms 48560 KB Output is correct
38 Correct 45 ms 48636 KB Output is correct
39 Correct 44 ms 48592 KB Output is correct
40 Correct 43 ms 48708 KB Output is correct
41 Correct 44 ms 48708 KB Output is correct
42 Correct 43 ms 48648 KB Output is correct
43 Correct 45 ms 48708 KB Output is correct
44 Correct 44 ms 48652 KB Output is correct
45 Correct 42 ms 48760 KB Output is correct
46 Correct 43 ms 48580 KB Output is correct
47 Correct 44 ms 48700 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47244 KB Output is correct
2 Correct 26 ms 47288 KB Output is correct
3 Correct 25 ms 47288 KB Output is correct
4 Correct 26 ms 47204 KB Output is correct
5 Correct 30 ms 47288 KB Output is correct
6 Correct 26 ms 47308 KB Output is correct
7 Correct 27 ms 47216 KB Output is correct
8 Correct 30 ms 47308 KB Output is correct
9 Correct 34 ms 47224 KB Output is correct
10 Correct 26 ms 47264 KB Output is correct
11 Correct 26 ms 47252 KB Output is correct
12 Correct 24 ms 47292 KB Output is correct
13 Correct 27 ms 47200 KB Output is correct
14 Correct 29 ms 47276 KB Output is correct
15 Correct 27 ms 47308 KB Output is correct
16 Correct 25 ms 47244 KB Output is correct
17 Correct 29 ms 47248 KB Output is correct
18 Correct 25 ms 47308 KB Output is correct
19 Correct 29 ms 47264 KB Output is correct
20 Correct 29 ms 47280 KB Output is correct
21 Correct 28 ms 47296 KB Output is correct
22 Correct 29 ms 47180 KB Output is correct
23 Correct 30 ms 47212 KB Output is correct
24 Correct 29 ms 47164 KB Output is correct
25 Correct 28 ms 47188 KB Output is correct
26 Correct 31 ms 47252 KB Output is correct
27 Correct 43 ms 48444 KB Output is correct
28 Correct 41 ms 48360 KB Output is correct
29 Correct 41 ms 48488 KB Output is correct
30 Correct 42 ms 48480 KB Output is correct
31 Correct 43 ms 48476 KB Output is correct
32 Correct 42 ms 48480 KB Output is correct
33 Correct 42 ms 48412 KB Output is correct
34 Correct 41 ms 48552 KB Output is correct
35 Correct 43 ms 48452 KB Output is correct
36 Correct 42 ms 48580 KB Output is correct
37 Correct 44 ms 48560 KB Output is correct
38 Correct 45 ms 48636 KB Output is correct
39 Correct 44 ms 48592 KB Output is correct
40 Correct 43 ms 48708 KB Output is correct
41 Correct 44 ms 48708 KB Output is correct
42 Correct 43 ms 48648 KB Output is correct
43 Correct 45 ms 48708 KB Output is correct
44 Correct 44 ms 48652 KB Output is correct
45 Correct 42 ms 48760 KB Output is correct
46 Correct 43 ms 48580 KB Output is correct
47 Correct 44 ms 48700 KB Output is correct
48 Correct 191 ms 58436 KB Output is correct
49 Correct 192 ms 58428 KB Output is correct
50 Correct 194 ms 58388 KB Output is correct
51 Correct 188 ms 58304 KB Output is correct
52 Correct 177 ms 57412 KB Output is correct
53 Correct 189 ms 57680 KB Output is correct
54 Correct 185 ms 56644 KB Output is correct
55 Correct 191 ms 56464 KB Output is correct
56 Correct 187 ms 56132 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47244 KB Output is correct
2 Correct 26 ms 47288 KB Output is correct
3 Correct 25 ms 47288 KB Output is correct
4 Correct 26 ms 47204 KB Output is correct
5 Correct 30 ms 47288 KB Output is correct
6 Correct 26 ms 47308 KB Output is correct
7 Correct 27 ms 47216 KB Output is correct
8 Correct 30 ms 47308 KB Output is correct
9 Correct 34 ms 47224 KB Output is correct
10 Correct 26 ms 47264 KB Output is correct
11 Correct 26 ms 47252 KB Output is correct
12 Correct 24 ms 47292 KB Output is correct
13 Correct 27 ms 47200 KB Output is correct
14 Correct 29 ms 47276 KB Output is correct
15 Correct 27 ms 47308 KB Output is correct
16 Correct 25 ms 47244 KB Output is correct
17 Correct 29 ms 47248 KB Output is correct
18 Correct 25 ms 47308 KB Output is correct
19 Correct 29 ms 47264 KB Output is correct
20 Correct 29 ms 47280 KB Output is correct
21 Correct 28 ms 47296 KB Output is correct
22 Correct 29 ms 47180 KB Output is correct
23 Correct 30 ms 47212 KB Output is correct
24 Correct 29 ms 47164 KB Output is correct
25 Correct 28 ms 47188 KB Output is correct
26 Correct 31 ms 47252 KB Output is correct
27 Correct 43 ms 48444 KB Output is correct
28 Correct 41 ms 48360 KB Output is correct
29 Correct 41 ms 48488 KB Output is correct
30 Correct 42 ms 48480 KB Output is correct
31 Correct 43 ms 48476 KB Output is correct
32 Correct 42 ms 48480 KB Output is correct
33 Correct 42 ms 48412 KB Output is correct
34 Correct 41 ms 48552 KB Output is correct
35 Correct 43 ms 48452 KB Output is correct
36 Correct 42 ms 48580 KB Output is correct
37 Correct 44 ms 48560 KB Output is correct
38 Correct 45 ms 48636 KB Output is correct
39 Correct 44 ms 48592 KB Output is correct
40 Correct 43 ms 48708 KB Output is correct
41 Correct 44 ms 48708 KB Output is correct
42 Correct 43 ms 48648 KB Output is correct
43 Correct 45 ms 48708 KB Output is correct
44 Correct 44 ms 48652 KB Output is correct
45 Correct 42 ms 48760 KB Output is correct
46 Correct 43 ms 48580 KB Output is correct
47 Correct 44 ms 48700 KB Output is correct
48 Correct 191 ms 58436 KB Output is correct
49 Correct 192 ms 58428 KB Output is correct
50 Correct 194 ms 58388 KB Output is correct
51 Correct 188 ms 58304 KB Output is correct
52 Correct 177 ms 57412 KB Output is correct
53 Correct 189 ms 57680 KB Output is correct
54 Correct 185 ms 56644 KB Output is correct
55 Correct 191 ms 56464 KB Output is correct
56 Correct 187 ms 56132 KB Output is correct
57 Correct 890 ms 109600 KB Output is correct
58 Correct 740 ms 86544 KB Output is correct
59 Correct 748 ms 86384 KB Output is correct
60 Correct 855 ms 92208 KB Output is correct
61 Correct 835 ms 92536 KB Output is correct
62 Correct 404 ms 72504 KB Output is correct
63 Correct 538 ms 79080 KB Output is correct
64 Correct 450 ms 75152 KB Output is correct
65 Correct 270 ms 64732 KB Output is correct