Submission #398764

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
398764	2021-05-04T19:39:48 Z	duality	Rope (JOI17_rope)	C++11	0 / 100	14 ms	23832 KB

rope

#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 adj[1000000];
int sub[1000000];
bool comp(int a,int b) {
    return occ[a] > occ[b];
}
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,order[i] = i;
    for (i = 0; i < N; i++) occ[C[i]]++;
    sort(order,order+N,comp);
    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: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:68:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   68 |     scanf("%d %d",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~
rope.cpp:69:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   69 |     for (i = 0; i < N; i++) scanf("%d",&C[i]),C[i]--;
      |                             ~~~~~^~~~~~~~~~~~

Subtask #1
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	14 ms	23832 KB	Output is correct
4	Correct	13 ms	23804 KB	Output is correct
5	Correct	13 ms	23756 KB	Output is correct
6	Correct	13 ms	23756 KB	Output is correct
7	Correct	13 ms	23776 KB	Output is correct
8	Correct	13 ms	23788 KB	Output is correct
9	Correct	13 ms	23712 KB	Output is correct
10	Correct	13 ms	23824 KB	Output is correct
11	Correct	13 ms	23756 KB	Output is correct
12	Correct	14 ms	23756 KB	Output is correct
13	Correct	13 ms	23820 KB	Output is correct
14	Correct	13 ms	23828 KB	Output is correct
15	Correct	13 ms	23756 KB	Output is correct
16	Correct	13 ms	23756 KB	Output is correct
17	Correct	13 ms	23824 KB	Output is correct
18	Correct	13 ms	23708 KB	Output is correct
19	Correct	13 ms	23756 KB	Output is correct
20	Correct	13 ms	23732 KB	Output is correct
21	Correct	13 ms	23820 KB	Output is correct
22	Correct	13 ms	23756 KB	Output is correct
23	Correct	13 ms	23756 KB	Output is correct
24	Incorrect	13 ms	23760 KB	Output isn't correct
25	Halted	0 ms	0 KB	-

Subtask #2
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	14 ms	23832 KB	Output is correct
4	Correct	13 ms	23804 KB	Output is correct
5	Correct	13 ms	23756 KB	Output is correct
6	Correct	13 ms	23756 KB	Output is correct
7	Correct	13 ms	23776 KB	Output is correct
8	Correct	13 ms	23788 KB	Output is correct
9	Correct	13 ms	23712 KB	Output is correct
10	Correct	13 ms	23824 KB	Output is correct
11	Correct	13 ms	23756 KB	Output is correct
12	Correct	14 ms	23756 KB	Output is correct
13	Correct	13 ms	23820 KB	Output is correct
14	Correct	13 ms	23828 KB	Output is correct
15	Correct	13 ms	23756 KB	Output is correct
16	Correct	13 ms	23756 KB	Output is correct
17	Correct	13 ms	23824 KB	Output is correct
18	Correct	13 ms	23708 KB	Output is correct
19	Correct	13 ms	23756 KB	Output is correct
20	Correct	13 ms	23732 KB	Output is correct
21	Correct	13 ms	23820 KB	Output is correct
22	Correct	13 ms	23756 KB	Output is correct
23	Correct	13 ms	23756 KB	Output is correct
24	Incorrect	13 ms	23760 KB	Output isn't correct
25	Halted	0 ms	0 KB	-

Subtask #3
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	14 ms	23832 KB	Output is correct
4	Correct	13 ms	23804 KB	Output is correct
5	Correct	13 ms	23756 KB	Output is correct
6	Correct	13 ms	23756 KB	Output is correct
7	Correct	13 ms	23776 KB	Output is correct
8	Correct	13 ms	23788 KB	Output is correct
9	Correct	13 ms	23712 KB	Output is correct
10	Correct	13 ms	23824 KB	Output is correct
11	Correct	13 ms	23756 KB	Output is correct
12	Correct	14 ms	23756 KB	Output is correct
13	Correct	13 ms	23820 KB	Output is correct
14	Correct	13 ms	23828 KB	Output is correct
15	Correct	13 ms	23756 KB	Output is correct
16	Correct	13 ms	23756 KB	Output is correct
17	Correct	13 ms	23824 KB	Output is correct
18	Correct	13 ms	23708 KB	Output is correct
19	Correct	13 ms	23756 KB	Output is correct
20	Correct	13 ms	23732 KB	Output is correct
21	Correct	13 ms	23820 KB	Output is correct
22	Correct	13 ms	23756 KB	Output is correct
23	Correct	13 ms	23756 KB	Output is correct
24	Incorrect	13 ms	23760 KB	Output isn't correct
25	Halted	0 ms	0 KB	-

Subtask #4
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	14 ms	23832 KB	Output is correct
4	Correct	13 ms	23804 KB	Output is correct
5	Correct	13 ms	23756 KB	Output is correct
6	Correct	13 ms	23756 KB	Output is correct
7	Correct	13 ms	23776 KB	Output is correct
8	Correct	13 ms	23788 KB	Output is correct
9	Correct	13 ms	23712 KB	Output is correct
10	Correct	13 ms	23824 KB	Output is correct
11	Correct	13 ms	23756 KB	Output is correct
12	Correct	14 ms	23756 KB	Output is correct
13	Correct	13 ms	23820 KB	Output is correct
14	Correct	13 ms	23828 KB	Output is correct
15	Correct	13 ms	23756 KB	Output is correct
16	Correct	13 ms	23756 KB	Output is correct
17	Correct	13 ms	23824 KB	Output is correct
18	Correct	13 ms	23708 KB	Output is correct
19	Correct	13 ms	23756 KB	Output is correct
20	Correct	13 ms	23732 KB	Output is correct
21	Correct	13 ms	23820 KB	Output is correct
22	Correct	13 ms	23756 KB	Output is correct
23	Correct	13 ms	23756 KB	Output is correct
24	Incorrect	13 ms	23760 KB	Output isn't correct
25	Halted	0 ms	0 KB	-

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	14 ms	23832 KB	Output is correct
4	Correct	13 ms	23804 KB	Output is correct
5	Correct	13 ms	23756 KB	Output is correct
6	Correct	13 ms	23756 KB	Output is correct
7	Correct	13 ms	23776 KB	Output is correct
8	Correct	13 ms	23788 KB	Output is correct
9	Correct	13 ms	23712 KB	Output is correct
10	Correct	13 ms	23824 KB	Output is correct
11	Correct	13 ms	23756 KB	Output is correct
12	Correct	14 ms	23756 KB	Output is correct
13	Correct	13 ms	23820 KB	Output is correct
14	Correct	13 ms	23828 KB	Output is correct
15	Correct	13 ms	23756 KB	Output is correct
16	Correct	13 ms	23756 KB	Output is correct
17	Correct	13 ms	23824 KB	Output is correct
18	Correct	13 ms	23708 KB	Output is correct
19	Correct	13 ms	23756 KB	Output is correct
20	Correct	13 ms	23732 KB	Output is correct
21	Correct	13 ms	23820 KB	Output is correct
22	Correct	13 ms	23756 KB	Output is correct
23	Correct	13 ms	23756 KB	Output is correct
24	Incorrect	13 ms	23760 KB	Output isn't correct
25	Halted	0 ms	0 KB	-

Submission #398764

Compilation message

Subtask #1 0 / 15.0

Subtask #2 0 / 30.0

Subtask #3 0 / 10.0

Subtask #4 0 / 25.0

Subtask #5 0 / 20.0

Subtask #1
0 / 15.0

Subtask #2
0 / 30.0

Subtask #3
0 / 10.0

Subtask #4
0 / 25.0

Subtask #5
0 / 20.0