Submission #134479

#	Time	Username	Problem	Language	Result	Execution time	Memory
134479		duality	Remittance (JOI19_remittance)	C++11	100 / 100	500 ms	28156 KiB

remittance

#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 A[1000000],B[1000000];
int num[1000032];
int need[1000000],diff[1000000];
queue<int> Q;
int in[1000000];
int main() {
    int i;
    int N;
    scanf("%d",&N);
    for (i = 0; i < N; i++) scanf("%d %d",&A[i],&B[i]),diff[i] = A[i]-B[i];

    for (i = 0; i < N; i++) {
        int j = i,x = A[i];
        while (x > 0) num[j] += (x & 1),x >>= 1,j++;
    }
    int a = 0;
    while (1) {
        for (i = 0; i < N+30; i++) num[i+1] += num[i] >> 1,num[i] &= 1;
        int p = a;
        for (i = N; i < N+30; i++) a += (num[i] << (i-N)),num[i] = 0;
        if (p == a) break;
        else num[0] += a-p;
    }
    fill(num,num+N+32,0);
    for (i = 0; i < N; i++) {
        int j = i,x = B[i];
        while (x > 0) num[j] += (x & 1),x >>= 1,j++;
    }
    int b = 0;
    while (1) {
        for (i = 0; i < N+30; i++) num[i+1] += num[i] >> 1,num[i] &= 1;
        int p = b;
        for (i = N; i < N+30; i++) b += (num[i] << (i-N)),num[i] = 0;
        if (p == b) break;
        else num[0] += b-p;
    }
    if (a < b) {
        printf("No\n");
        return 0;
    }
    need[N-1] = a-b,diff[N-1] -= 2*(a-b),diff[0] += a-b;
    for (i = 0; i < N-1; i++) {
        if ((diff[i] < 0) || (diff[i] & 1)) {
            printf("No\n");
            return 0;
        }
        need[i] = diff[i]/2,diff[i+1] += need[i];
    }

    for (i = 0; i < N; i++) {
        if ((need[i] > 0) && (A[i] >= 2)) Q.push(i),in[i] = 1;
    }
    while (!Q.empty()) {
        int u = Q.front();
        Q.pop(),in[u] = 0;

        if ((need[u] > 0) && (A[u] >= 2)) {
            int sub = min(A[u]/2,need[u]);
            A[u] -= 2*sub,need[u] -= sub,A[(u+1) % N] += sub;
            if (!in[u] && (need[u] > 0) && (A[u] >= 2)) Q.push(u),in[u] = 1;
            u = (u+1) % N;
            if (!in[u] && (need[u] > 0) && (A[u] >= 2)) Q.push(u),in[u] = 1;
        }
    }
    for (i = 0; i < N; i++) {
        if (A[i] != B[i]) {
            printf("No\n");
            return 0;
        }
    }
    printf("Yes\n");

    return 0;
}

Compilation message (stderr)

remittance.cpp: In function 'int main()':
remittance.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
remittance.cpp:67:55: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%d %d",&A[i],&B[i]),diff[i] = A[i]-B[i];
                             ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 40 / 40
• Subtask 3: 45 / 45