Submission #400319

#	Time	Username	Problem	Language	Result	Execution time	Memory
400319		duality	Arranging Tickets (JOI17_arranging_tickets)	C++11	0 / 100	1 ms	204 KiB

arranging_tickets

#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 N,A[100000],B[100000],C[100000];
int used[100000];
int dist(int a,int b) {
    return (b-a+N) % N;
}
int main() {
    int i;
    int M;
    LLI ans = 0;
    scanf("%d %d",&N,&M);
    for (i = 0; i < M; i++) {
        scanf("%d %d %d",&A[i],&B[i],&C[i]);
        if (!(C[i] & 1)) ans += C[i]/2,i--,M--;
    }

    int j,k;
    LLI ans2 = (M == 0) ? 0:(LLI) 1e18;
    for (i = 0; i < M; i++) {
        used[i] = 1;
        int u = B[i];
        LLI d = dist(A[i],B[i]);
        for (j = 0; j < M-1; j++) {
            int b = -1,e = -1;
            for (k = 0; k < M; k++) {
                if (!used[k] && ((b == -1) || (dist(u,A[k]) < dist(u,e ? B[b]:A[b])))) b = k,e = 0;
                if (!used[k] && ((b == -1) || (dist(u,B[k]) < dist(u,e ? B[b]:A[b])))) b = k,e = 1;
            }
            used[b] = 1;
            d += dist(u,e ? B[b]:A[b]);
            if (e) d += dist(B[b],A[b]);
            else d += dist(A[b],B[b]);
            u = e ? A[b]:B[b];
        }
        ans2 = min(ans2,(d+N-1)/N);
        fill(used,used+M,0);
    }
    printf("%lld\n",ans+ans2);

    return 0;
}

Compilation message (stderr)

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:67:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   67 |     scanf("%d %d",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~
arranging_tickets.cpp:69:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   69 |         scanf("%d %d %d",&A[i],&B[i],&C[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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