oj.uz

답안 #398765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
398765 2021-05-04T19:40:23 Z duality Rope (JOI17_rope) C++11
100 / 100
 873 ms 81796 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 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+M,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
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23824 KB Output is correct
2 Correct 13 ms 23772 KB Output is correct
3 Correct 13 ms 23756 KB Output is correct
4 Correct 13 ms 23740 KB Output is correct
5 Correct 13 ms 23808 KB Output is correct
6 Correct 13 ms 23756 KB Output is correct
7 Correct 13 ms 23772 KB Output is correct
8 Correct 13 ms 23808 KB Output is correct
9 Correct 15 ms 23756 KB Output is correct
10 Correct 14 ms 23700 KB Output is correct
11 Correct 13 ms 23708 KB Output is correct
12 Correct 13 ms 23824 KB Output is correct
13 Correct 13 ms 23756 KB Output is correct
14 Correct 14 ms 23824 KB Output is correct
15 Correct 13 ms 23708 KB Output is correct
16 Correct 13 ms 23736 KB Output is correct
17 Correct 13 ms 23756 KB Output is correct
18 Correct 13 ms 23784 KB Output is correct
19 Correct 13 ms 23704 KB Output is correct
20 Correct 13 ms 23816 KB Output is correct
21 Correct 13 ms 23756 KB Output is correct
22 Correct 13 ms 23812 KB Output is correct
23 Correct 13 ms 23756 KB Output is correct
24 Correct 13 ms 23756 KB Output is correct
25 Correct 14 ms 23824 KB Output is correct
26 Correct 13 ms 23796 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23824 KB Output is correct
2 Correct 13 ms 23772 KB Output is correct
3 Correct 13 ms 23756 KB Output is correct
4 Correct 13 ms 23740 KB Output is correct
5 Correct 13 ms 23808 KB Output is correct
6 Correct 13 ms 23756 KB Output is correct
7 Correct 13 ms 23772 KB Output is correct
8 Correct 13 ms 23808 KB Output is correct
9 Correct 15 ms 23756 KB Output is correct
10 Correct 14 ms 23700 KB Output is correct
11 Correct 13 ms 23708 KB Output is correct
12 Correct 13 ms 23824 KB Output is correct
13 Correct 13 ms 23756 KB Output is correct
14 Correct 14 ms 23824 KB Output is correct
15 Correct 13 ms 23708 KB Output is correct
16 Correct 13 ms 23736 KB Output is correct
17 Correct 13 ms 23756 KB Output is correct
18 Correct 13 ms 23784 KB Output is correct
19 Correct 13 ms 23704 KB Output is correct
20 Correct 13 ms 23816 KB Output is correct
21 Correct 13 ms 23756 KB Output is correct
22 Correct 13 ms 23812 KB Output is correct
23 Correct 13 ms 23756 KB Output is correct
24 Correct 13 ms 23756 KB Output is correct
25 Correct 14 ms 23824 KB Output is correct
26 Correct 13 ms 23796 KB Output is correct
27 Correct 26 ms 24732 KB Output is correct
28 Correct 26 ms 24652 KB Output is correct
29 Correct 26 ms 24776 KB Output is correct
30 Correct 25 ms 24780 KB Output is correct
31 Correct 26 ms 24716 KB Output is correct
32 Correct 27 ms 24848 KB Output is correct
33 Correct 26 ms 24700 KB Output is correct
34 Correct 27 ms 24840 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23824 KB Output is correct
2 Correct 13 ms 23772 KB Output is correct
3 Correct 13 ms 23756 KB Output is correct
4 Correct 13 ms 23740 KB Output is correct
5 Correct 13 ms 23808 KB Output is correct
6 Correct 13 ms 23756 KB Output is correct
7 Correct 13 ms 23772 KB Output is correct
8 Correct 13 ms 23808 KB Output is correct
9 Correct 15 ms 23756 KB Output is correct
10 Correct 14 ms 23700 KB Output is correct
11 Correct 13 ms 23708 KB Output is correct
12 Correct 13 ms 23824 KB Output is correct
13 Correct 13 ms 23756 KB Output is correct
14 Correct 14 ms 23824 KB Output is correct
15 Correct 13 ms 23708 KB Output is correct
16 Correct 13 ms 23736 KB Output is correct
17 Correct 13 ms 23756 KB Output is correct
18 Correct 13 ms 23784 KB Output is correct
19 Correct 13 ms 23704 KB Output is correct
20 Correct 13 ms 23816 KB Output is correct
21 Correct 13 ms 23756 KB Output is correct
22 Correct 13 ms 23812 KB Output is correct
23 Correct 13 ms 23756 KB Output is correct
24 Correct 13 ms 23756 KB Output is correct
25 Correct 14 ms 23824 KB Output is correct
26 Correct 13 ms 23796 KB Output is correct
27 Correct 26 ms 24732 KB Output is correct
28 Correct 26 ms 24652 KB Output is correct
29 Correct 26 ms 24776 KB Output is correct
30 Correct 25 ms 24780 KB Output is correct
31 Correct 26 ms 24716 KB Output is correct
32 Correct 27 ms 24848 KB Output is correct
33 Correct 26 ms 24700 KB Output is correct
34 Correct 27 ms 24840 KB Output is correct
35 Correct 27 ms 24804 KB Output is correct
36 Correct 27 ms 24788 KB Output is correct
37 Correct 27 ms 24784 KB Output is correct
38 Correct 28 ms 24768 KB Output is correct
39 Correct 27 ms 24732 KB Output is correct
40 Correct 28 ms 24876 KB Output is correct
41 Correct 36 ms 24768 KB Output is correct
42 Correct 27 ms 24836 KB Output is correct
43 Correct 27 ms 24792 KB Output is correct
44 Correct 27 ms 24748 KB Output is correct
45 Correct 28 ms 24880 KB Output is correct
46 Correct 28 ms 24836 KB Output is correct
47 Correct 28 ms 24944 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23824 KB Output is correct
2 Correct 13 ms 23772 KB Output is correct
3 Correct 13 ms 23756 KB Output is correct
4 Correct 13 ms 23740 KB Output is correct
5 Correct 13 ms 23808 KB Output is correct
6 Correct 13 ms 23756 KB Output is correct
7 Correct 13 ms 23772 KB Output is correct
8 Correct 13 ms 23808 KB Output is correct
9 Correct 15 ms 23756 KB Output is correct
10 Correct 14 ms 23700 KB Output is correct
11 Correct 13 ms 23708 KB Output is correct
12 Correct 13 ms 23824 KB Output is correct
13 Correct 13 ms 23756 KB Output is correct
14 Correct 14 ms 23824 KB Output is correct
15 Correct 13 ms 23708 KB Output is correct
16 Correct 13 ms 23736 KB Output is correct
17 Correct 13 ms 23756 KB Output is correct
18 Correct 13 ms 23784 KB Output is correct
19 Correct 13 ms 23704 KB Output is correct
20 Correct 13 ms 23816 KB Output is correct
21 Correct 13 ms 23756 KB Output is correct
22 Correct 13 ms 23812 KB Output is correct
23 Correct 13 ms 23756 KB Output is correct
24 Correct 13 ms 23756 KB Output is correct
25 Correct 14 ms 23824 KB Output is correct
26 Correct 13 ms 23796 KB Output is correct
27 Correct 26 ms 24732 KB Output is correct
28 Correct 26 ms 24652 KB Output is correct
29 Correct 26 ms 24776 KB Output is correct
30 Correct 25 ms 24780 KB Output is correct
31 Correct 26 ms 24716 KB Output is correct
32 Correct 27 ms 24848 KB Output is correct
33 Correct 26 ms 24700 KB Output is correct
34 Correct 27 ms 24840 KB Output is correct
35 Correct 27 ms 24804 KB Output is correct
36 Correct 27 ms 24788 KB Output is correct
37 Correct 27 ms 24784 KB Output is correct
38 Correct 28 ms 24768 KB Output is correct
39 Correct 27 ms 24732 KB Output is correct
40 Correct 28 ms 24876 KB Output is correct
41 Correct 36 ms 24768 KB Output is correct
42 Correct 27 ms 24836 KB Output is correct
43 Correct 27 ms 24792 KB Output is correct
44 Correct 27 ms 24748 KB Output is correct
45 Correct 28 ms 24880 KB Output is correct
46 Correct 28 ms 24836 KB Output is correct
47 Correct 28 ms 24944 KB Output is correct
48 Correct 167 ms 34484 KB Output is correct
49 Correct 168 ms 34432 KB Output is correct
50 Correct 169 ms 34456 KB Output is correct
51 Correct 162 ms 34400 KB Output is correct
52 Correct 152 ms 33336 KB Output is correct
53 Correct 163 ms 33540 KB Output is correct
54 Correct 162 ms 32612 KB Output is correct
55 Correct 161 ms 32404 KB Output is correct
56 Correct 171 ms 32068 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23824 KB Output is correct
2 Correct 13 ms 23772 KB Output is correct
3 Correct 13 ms 23756 KB Output is correct
4 Correct 13 ms 23740 KB Output is correct
5 Correct 13 ms 23808 KB Output is correct
6 Correct 13 ms 23756 KB Output is correct
7 Correct 13 ms 23772 KB Output is correct
8 Correct 13 ms 23808 KB Output is correct
9 Correct 15 ms 23756 KB Output is correct
10 Correct 14 ms 23700 KB Output is correct
11 Correct 13 ms 23708 KB Output is correct
12 Correct 13 ms 23824 KB Output is correct
13 Correct 13 ms 23756 KB Output is correct
14 Correct 14 ms 23824 KB Output is correct
15 Correct 13 ms 23708 KB Output is correct
16 Correct 13 ms 23736 KB Output is correct
17 Correct 13 ms 23756 KB Output is correct
18 Correct 13 ms 23784 KB Output is correct
19 Correct 13 ms 23704 KB Output is correct
20 Correct 13 ms 23816 KB Output is correct
21 Correct 13 ms 23756 KB Output is correct
22 Correct 13 ms 23812 KB Output is correct
23 Correct 13 ms 23756 KB Output is correct
24 Correct 13 ms 23756 KB Output is correct
25 Correct 14 ms 23824 KB Output is correct
26 Correct 13 ms 23796 KB Output is correct
27 Correct 26 ms 24732 KB Output is correct
28 Correct 26 ms 24652 KB Output is correct
29 Correct 26 ms 24776 KB Output is correct
30 Correct 25 ms 24780 KB Output is correct
31 Correct 26 ms 24716 KB Output is correct
32 Correct 27 ms 24848 KB Output is correct
33 Correct 26 ms 24700 KB Output is correct
34 Correct 27 ms 24840 KB Output is correct
35 Correct 27 ms 24804 KB Output is correct
36 Correct 27 ms 24788 KB Output is correct
37 Correct 27 ms 24784 KB Output is correct
38 Correct 28 ms 24768 KB Output is correct
39 Correct 27 ms 24732 KB Output is correct
40 Correct 28 ms 24876 KB Output is correct
41 Correct 36 ms 24768 KB Output is correct
42 Correct 27 ms 24836 KB Output is correct
43 Correct 27 ms 24792 KB Output is correct
44 Correct 27 ms 24748 KB Output is correct
45 Correct 28 ms 24880 KB Output is correct
46 Correct 28 ms 24836 KB Output is correct
47 Correct 28 ms 24944 KB Output is correct
48 Correct 167 ms 34484 KB Output is correct
49 Correct 168 ms 34432 KB Output is correct
50 Correct 169 ms 34456 KB Output is correct
51 Correct 162 ms 34400 KB Output is correct
52 Correct 152 ms 33336 KB Output is correct
53 Correct 163 ms 33540 KB Output is correct
54 Correct 162 ms 32612 KB Output is correct
55 Correct 161 ms 32404 KB Output is correct
56 Correct 171 ms 32068 KB Output is correct
57 Correct 873 ms 81796 KB Output is correct
58 Correct 698 ms 66700 KB Output is correct
59 Correct 685 ms 66600 KB Output is correct
60 Correct 742 ms 72132 KB Output is correct
61 Correct 770 ms 72296 KB Output is correct
62 Correct 372 ms 53444 KB Output is correct
63 Correct 535 ms 59504 KB Output is correct
64 Correct 445 ms 55792 KB Output is correct
65 Correct 261 ms 45844 KB Output is correct