oj.uz

Submission #398755

# Submission time Handle Problem Language Result Execution time Memory
398755 2021-05-04T19:29:22 Z duality Rope (JOI17_rope) C++11
80 / 100
 2500 ms 81696 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];
vi adj[1000000];
int tree[1 << 21];
int build(int s,int e,int i) {
    if (s == e) {
        tree[i] = occ[s];
        return 0;
    }

    int mid = (s+e) / 2;
    build(s,mid,2*i+1),build(mid+1,e,2*i+2);
    tree[i] = max(tree[2*i+1],tree[2*i+2]);
    return 0;
}
int update(int s,int e,int ai,int i,int num) {
    if ((s > ai) || (e < ai)) return 0;
    else if (s == e) {
        tree[i] += num;
        return 0;
    }

    int mid = (s+e) / 2;
    update(s,mid,ai,2*i+1,num),update(mid+1,e,ai,2*i+2,num);
    tree[i] = max(tree[2*i+1],tree[2*i+2]);
    return 0;
}
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;
    for (i = 0; i < M; i++) ans[i] = N;
    for (i = 0; i < N; i++) occ[C[i]]++;
    build(0,M-1,0);
    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++) update(0,M-1,adj[i][j],0,-1);
            update(0,M-1,i,0,-1e9);
            ans[i] = min(ans[i],N-occ[i]-tree[0]);
            for (j = 0; j < adj[i].size(); j++) update(0,M-1,adj[i][j],0,1);
            update(0,M-1,i,0,1e9);
            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:105:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |             for (j = 0; j < adj[i].size(); j++) update(0,M-1,adj[i][j],0,-1);
      |                         ~~^~~~~~~~~~~~~~~
rope.cpp:108:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |             for (j = 0; j < adj[i].size(); j++) update(0,M-1,adj[i][j],0,1);
      |                         ~~^~~~~~~~~~~~~~~
rope.cpp:88:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   88 |     scanf("%d %d",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~
rope.cpp:89:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   89 |     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 13 ms 23756 KB Output is correct
2 Correct 13 ms 23756 KB Output is correct
3 Correct 13 ms 23796 KB Output is correct
4 Correct 15 ms 23768 KB Output is correct
5 Correct 13 ms 23792 KB Output is correct
6 Correct 13 ms 23800 KB Output is correct
7 Correct 14 ms 23924 KB Output is correct
8 Correct 13 ms 23732 KB Output is correct
9 Correct 13 ms 23756 KB Output is correct
10 Correct 13 ms 23784 KB Output is correct
11 Correct 13 ms 23740 KB Output is correct
12 Correct 13 ms 23792 KB Output is correct
13 Correct 13 ms 23796 KB Output is correct
14 Correct 13 ms 23800 KB Output is correct
15 Correct 13 ms 23756 KB Output is correct
16 Correct 13 ms 23760 KB Output is correct
17 Correct 13 ms 23812 KB Output is correct
18 Correct 13 ms 23700 KB Output is correct
19 Correct 13 ms 23724 KB Output is correct
20 Correct 13 ms 23756 KB Output is correct
21 Correct 13 ms 23756 KB Output is correct
22 Correct 13 ms 23760 KB Output is correct
23 Correct 13 ms 23752 KB Output is correct
24 Correct 13 ms 23756 KB Output is correct
25 Correct 13 ms 23792 KB Output is correct
26 Correct 16 ms 23784 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23756 KB Output is correct
2 Correct 13 ms 23756 KB Output is correct
3 Correct 13 ms 23796 KB Output is correct
4 Correct 15 ms 23768 KB Output is correct
5 Correct 13 ms 23792 KB Output is correct
6 Correct 13 ms 23800 KB Output is correct
7 Correct 14 ms 23924 KB Output is correct
8 Correct 13 ms 23732 KB Output is correct
9 Correct 13 ms 23756 KB Output is correct
10 Correct 13 ms 23784 KB Output is correct
11 Correct 13 ms 23740 KB Output is correct
12 Correct 13 ms 23792 KB Output is correct
13 Correct 13 ms 23796 KB Output is correct
14 Correct 13 ms 23800 KB Output is correct
15 Correct 13 ms 23756 KB Output is correct
16 Correct 13 ms 23760 KB Output is correct
17 Correct 13 ms 23812 KB Output is correct
18 Correct 13 ms 23700 KB Output is correct
19 Correct 13 ms 23724 KB Output is correct
20 Correct 13 ms 23756 KB Output is correct
21 Correct 13 ms 23756 KB Output is correct
22 Correct 13 ms 23760 KB Output is correct
23 Correct 13 ms 23752 KB Output is correct
24 Correct 13 ms 23756 KB Output is correct
25 Correct 13 ms 23792 KB Output is correct
26 Correct 16 ms 23784 KB Output is correct
27 Correct 44 ms 25028 KB Output is correct
28 Correct 36 ms 24908 KB Output is correct
29 Correct 42 ms 24968 KB Output is correct
30 Correct 37 ms 24956 KB Output is correct
31 Correct 43 ms 25020 KB Output is correct
32 Correct 38 ms 24908 KB Output is correct
33 Correct 44 ms 24856 KB Output is correct
34 Correct 38 ms 25028 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23756 KB Output is correct
2 Correct 13 ms 23756 KB Output is correct
3 Correct 13 ms 23796 KB Output is correct
4 Correct 15 ms 23768 KB Output is correct
5 Correct 13 ms 23792 KB Output is correct
6 Correct 13 ms 23800 KB Output is correct
7 Correct 14 ms 23924 KB Output is correct
8 Correct 13 ms 23732 KB Output is correct
9 Correct 13 ms 23756 KB Output is correct
10 Correct 13 ms 23784 KB Output is correct
11 Correct 13 ms 23740 KB Output is correct
12 Correct 13 ms 23792 KB Output is correct
13 Correct 13 ms 23796 KB Output is correct
14 Correct 13 ms 23800 KB Output is correct
15 Correct 13 ms 23756 KB Output is correct
16 Correct 13 ms 23760 KB Output is correct
17 Correct 13 ms 23812 KB Output is correct
18 Correct 13 ms 23700 KB Output is correct
19 Correct 13 ms 23724 KB Output is correct
20 Correct 13 ms 23756 KB Output is correct
21 Correct 13 ms 23756 KB Output is correct
22 Correct 13 ms 23760 KB Output is correct
23 Correct 13 ms 23752 KB Output is correct
24 Correct 13 ms 23756 KB Output is correct
25 Correct 13 ms 23792 KB Output is correct
26 Correct 16 ms 23784 KB Output is correct
27 Correct 44 ms 25028 KB Output is correct
28 Correct 36 ms 24908 KB Output is correct
29 Correct 42 ms 24968 KB Output is correct
30 Correct 37 ms 24956 KB Output is correct
31 Correct 43 ms 25020 KB Output is correct
32 Correct 38 ms 24908 KB Output is correct
33 Correct 44 ms 24856 KB Output is correct
34 Correct 38 ms 25028 KB Output is correct
35 Correct 77 ms 25044 KB Output is correct
36 Correct 77 ms 25152 KB Output is correct
37 Correct 77 ms 25116 KB Output is correct
38 Correct 80 ms 25156 KB Output is correct
39 Correct 78 ms 25156 KB Output is correct
40 Correct 72 ms 25220 KB Output is correct
41 Correct 71 ms 25236 KB Output is correct
42 Correct 70 ms 25164 KB Output is correct
43 Correct 67 ms 25164 KB Output is correct
44 Correct 76 ms 25132 KB Output is correct
45 Correct 72 ms 25300 KB Output is correct
46 Correct 67 ms 25156 KB Output is correct
47 Correct 67 ms 25144 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23756 KB Output is correct
2 Correct 13 ms 23756 KB Output is correct
3 Correct 13 ms 23796 KB Output is correct
4 Correct 15 ms 23768 KB Output is correct
5 Correct 13 ms 23792 KB Output is correct
6 Correct 13 ms 23800 KB Output is correct
7 Correct 14 ms 23924 KB Output is correct
8 Correct 13 ms 23732 KB Output is correct
9 Correct 13 ms 23756 KB Output is correct
10 Correct 13 ms 23784 KB Output is correct
11 Correct 13 ms 23740 KB Output is correct
12 Correct 13 ms 23792 KB Output is correct
13 Correct 13 ms 23796 KB Output is correct
14 Correct 13 ms 23800 KB Output is correct
15 Correct 13 ms 23756 KB Output is correct
16 Correct 13 ms 23760 KB Output is correct
17 Correct 13 ms 23812 KB Output is correct
18 Correct 13 ms 23700 KB Output is correct
19 Correct 13 ms 23724 KB Output is correct
20 Correct 13 ms 23756 KB Output is correct
21 Correct 13 ms 23756 KB Output is correct
22 Correct 13 ms 23760 KB Output is correct
23 Correct 13 ms 23752 KB Output is correct
24 Correct 13 ms 23756 KB Output is correct
25 Correct 13 ms 23792 KB Output is correct
26 Correct 16 ms 23784 KB Output is correct
27 Correct 44 ms 25028 KB Output is correct
28 Correct 36 ms 24908 KB Output is correct
29 Correct 42 ms 24968 KB Output is correct
30 Correct 37 ms 24956 KB Output is correct
31 Correct 43 ms 25020 KB Output is correct
32 Correct 38 ms 24908 KB Output is correct
33 Correct 44 ms 24856 KB Output is correct
34 Correct 38 ms 25028 KB Output is correct
35 Correct 77 ms 25044 KB Output is correct
36 Correct 77 ms 25152 KB Output is correct
37 Correct 77 ms 25116 KB Output is correct
38 Correct 80 ms 25156 KB Output is correct
39 Correct 78 ms 25156 KB Output is correct
40 Correct 72 ms 25220 KB Output is correct
41 Correct 71 ms 25236 KB Output is correct
42 Correct 70 ms 25164 KB Output is correct
43 Correct 67 ms 25164 KB Output is correct
44 Correct 76 ms 25132 KB Output is correct
45 Correct 72 ms 25300 KB Output is correct
46 Correct 67 ms 25156 KB Output is correct
47 Correct 67 ms 25144 KB Output is correct
48 Correct 864 ms 39104 KB Output is correct
49 Correct 862 ms 38980 KB Output is correct
50 Correct 854 ms 38984 KB Output is correct
51 Correct 774 ms 38724 KB Output is correct
52 Correct 723 ms 37244 KB Output is correct
53 Correct 805 ms 38212 KB Output is correct
54 Correct 796 ms 37112 KB Output is correct
55 Correct 795 ms 36980 KB Output is correct
56 Correct 802 ms 36732 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23756 KB Output is correct
2 Correct 13 ms 23756 KB Output is correct
3 Correct 13 ms 23796 KB Output is correct
4 Correct 15 ms 23768 KB Output is correct
5 Correct 13 ms 23792 KB Output is correct
6 Correct 13 ms 23800 KB Output is correct
7 Correct 14 ms 23924 KB Output is correct
8 Correct 13 ms 23732 KB Output is correct
9 Correct 13 ms 23756 KB Output is correct
10 Correct 13 ms 23784 KB Output is correct
11 Correct 13 ms 23740 KB Output is correct
12 Correct 13 ms 23792 KB Output is correct
13 Correct 13 ms 23796 KB Output is correct
14 Correct 13 ms 23800 KB Output is correct
15 Correct 13 ms 23756 KB Output is correct
16 Correct 13 ms 23760 KB Output is correct
17 Correct 13 ms 23812 KB Output is correct
18 Correct 13 ms 23700 KB Output is correct
19 Correct 13 ms 23724 KB Output is correct
20 Correct 13 ms 23756 KB Output is correct
21 Correct 13 ms 23756 KB Output is correct
22 Correct 13 ms 23760 KB Output is correct
23 Correct 13 ms 23752 KB Output is correct
24 Correct 13 ms 23756 KB Output is correct
25 Correct 13 ms 23792 KB Output is correct
26 Correct 16 ms 23784 KB Output is correct
27 Correct 44 ms 25028 KB Output is correct
28 Correct 36 ms 24908 KB Output is correct
29 Correct 42 ms 24968 KB Output is correct
30 Correct 37 ms 24956 KB Output is correct
31 Correct 43 ms 25020 KB Output is correct
32 Correct 38 ms 24908 KB Output is correct
33 Correct 44 ms 24856 KB Output is correct
34 Correct 38 ms 25028 KB Output is correct
35 Correct 77 ms 25044 KB Output is correct
36 Correct 77 ms 25152 KB Output is correct
37 Correct 77 ms 25116 KB Output is correct
38 Correct 80 ms 25156 KB Output is correct
39 Correct 78 ms 25156 KB Output is correct
40 Correct 72 ms 25220 KB Output is correct
41 Correct 71 ms 25236 KB Output is correct
42 Correct 70 ms 25164 KB Output is correct
43 Correct 67 ms 25164 KB Output is correct
44 Correct 76 ms 25132 KB Output is correct
45 Correct 72 ms 25300 KB Output is correct
46 Correct 67 ms 25156 KB Output is correct
47 Correct 67 ms 25144 KB Output is correct
48 Correct 864 ms 39104 KB Output is correct
49 Correct 862 ms 38980 KB Output is correct
50 Correct 854 ms 38984 KB Output is correct
51 Correct 774 ms 38724 KB Output is correct
52 Correct 723 ms 37244 KB Output is correct
53 Correct 805 ms 38212 KB Output is correct
54 Correct 796 ms 37112 KB Output is correct
55 Correct 795 ms 36980 KB Output is correct
56 Correct 802 ms 36732 KB Output is correct
57 Execution timed out 2554 ms 81696 KB Time limit exceeded
58 Halted 0 ms 0 KB -