Submission #398747

#	Time	Username	Problem	Language	Result	Execution time	Memory
398747		duality	Rope (JOI17_rope)	C++11	45 / 100	2573 ms	1072 KiB

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];
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,k;
    for (i = 0; i < M; i++) ans[i] = N;
    for (i = 0; i < M; i++) {
        for (j = i+1; j < M; j++) {
            if (N & 1) {
                int a = 0;
                for (k = 0; k+1 < N; k += 2) {
                    int c1 = (C[k] != i) + (C[k+1] != i);
                    int c2 = (C[k] != j) + (C[k+1] != j);
                    a += min(c1,c2);
                }
                if ((C[k] != i) && (C[k] != j)) a++;
                ans[i] = min(ans[i],a);
                ans[j] = min(ans[j],a);
                a = 0;
                for (k = 1; k+1 < N; k += 2) {
                    int c1 = (C[k] != i) + (C[k+1] != i);
                    int c2 = (C[k] != j) + (C[k+1] != j);
                    a += min(c1,c2);
                }
                if ((C[0] != i) && (C[0] != j)) a++;
                ans[i] = min(ans[i],a);
                ans[j] = min(ans[j],a);
            }
            else {
                int a = 0;
                for (k = 0; k+1 < N; k += 2) {
                    int c1 = (C[k] != i) + (C[k+1] != i);
                    int c2 = (C[k] != j) + (C[k+1] != j);
                    a += min(c1,c2);
                }
                ans[i] = min(ans[i],a);
                ans[j] = min(ans[j],a);
                a = 0;
                for (k = 1; k+1 < N; k += 2) {
                    int c1 = (C[k] != i) + (C[k+1] != i);
                    int c2 = (C[k] != j) + (C[k+1] != j);
                    a += min(c1,c2);
                }
                if ((C[0] != i) && (C[0] != j)) a++;
                if ((C[k] != i) && (C[k] != j)) a++;
                ans[i] = min(ans[i],a);
                ans[j] = min(ans[j],a);
            }
        }
    }
    for (i = 0; i < M; i++) printf("%d\n",ans[i]);

    return 0;
}

Compilation message (stderr)

rope.cpp: In function 'int main()':
rope.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   63 |     scanf("%d %d",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~
rope.cpp:64:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |     for (i = 0; i < N; i++) scanf("%d",&C[i]),C[i]--;
      |                             ~~~~~^~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 30 / 30
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 20