Submission #123269

#	Time	Username	Problem	Language	Result	Execution time	Memory
123269		duality	Coin Collecting (JOI19_ho_t4)	C++11	0 / 100	7 ms	5112 KiB

joi2019_ho_t4

#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 X[200000],Y[200000];
pii p[200000];
vpii in[2];
vi adjList[200000];
int match[200000],visited[200000];
int doDFS(int u) {
    if (visited[u]) return 0;
    int i;
    visited[u] = 1;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if ((match[v] == -1) || doDFS(match[v])) {
            match[u] = v,match[v] = u;
            return 1;
        }
    }
    return 0;
}
int main() {
    int i;
    int N;
    LLI ans = 0;
    scanf("%d",&N);
    for (i = 0; i < 2*N; i++) {
        scanf("%d %d",&X[i],&Y[i]);
        //X[i] = rand(),Y[i] = rand();
        //X[i] = (rand() % N)+1,Y[i] = ((rand() % 2)+1);
        if (X[i] < 1) ans += 1-X[i],X[i] = 1;
        if (X[i] > N) ans += X[i]-N,X[i] = N;
        if (Y[i] < 1) ans += 1-Y[i],Y[i] = 1;
        if (Y[i] > 2) ans += Y[i]-2,Y[i] = 2;
        p[i] = mp(X[i],Y[i]);
    }
    sort(p,p+2*N);

    int j;
    LLI temp = ans;
    for (i = 0; i < 2*N; i++) {
        int x = i/2+1,y = (i % 2)+1;
        ans += abs(p[i].first-x)+abs(p[i].second-y);
        if (p[i].second != y) {
            y--;
            pii a = mp(x,p[i].first);
            in[!y].pb(a);
        }
    }
    for (i = 0; i < in[0].size(); i++) {
        for (j = 0; j < in[1].size(); j++) {
            pii a = in[0][i],b = in[1][j];
            if (abs(a.first-a.second)+abs(b.first-b.second)+2 > abs(a.first-b.second)+abs(b.first-a.second)) {
                if(abs(a.first-a.second)+abs(b.first-b.second) != abs(a.first-b.second)+abs(b.first-a.second)){
                    cout<<abs(a.first-a.second)+abs(b.first-b.second)<<" != ";
                    cout << abs(a.first-b.second)+abs(b.first-a.second)<<endl;
                    return -1;
                }
                adjList[i].pb(j+in[0].size());
                adjList[j+in[0].size()].pb(i);
            }
        }
    }
    fill(match,match+in[0].size()+in[1].size(),-1);
    for (i = 0; i < in[0].size(); i++) {
        fill(visited,visited+in[0].size()+in[1].size(),0);
        ans -= 2*doDFS(i);
    }
    printf("%lld\n",ans);

    return 0;
}

Compilation message (stderr)

joi2019_ho_t4.cpp: In function 'int doDFS(int)':
joi2019_ho_t4.cpp:67:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:104:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < in[0].size(); i++) {
                 ~~^~~~~~~~~~~~~~
joi2019_ho_t4.cpp:105:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < in[1].size(); j++) {
                     ~~^~~~~~~~~~~~~~
joi2019_ho_t4.cpp:119:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < in[0].size(); i++) {
                 ~~^~~~~~~~~~~~~~
joi2019_ho_t4.cpp:94:9: warning: unused variable 'temp' [-Wunused-variable]
     LLI temp = ans;
         ^~~~
joi2019_ho_t4.cpp:80:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
joi2019_ho_t4.cpp:82:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&X[i],&Y[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 63