oj.uz

답안 #119957

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
119957 2019-06-22T17:57:04 Z duality Two Transportations (JOI19_transportations) C++14
70 / 100
 1868 ms 85432 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 ----------
#include "Azer.h"

namespace {
    int N;
    vpii adjList[2000];
    int dist[2000],done[2000];
    int num,c = 0,s = 0,l = 0;
}

void InitA(int N,int A,vector<int> U,vector<int> V,vector<int> C) {
    int i;
    ::N = N;
    for (i = 0; i < N; i++) dist[i] = (1 << 20)-1,done[i] = 0;
    for (i = 0; i < A; i++) {
        adjList[U[i]].pb(mp(V[i],C[i]));
        adjList[V[i]].pb(mp(U[i],C[i]));
    }
    dist[0] = 0,done[0] = 1;
    for (i = 0; i < adjList[0].size(); i++) dist[adjList[0][i].first] = adjList[0][i].second;
}
void ReceiveA(bool x) {
    int i,m = -1;
    for (i = 0; i < N; i++) {
        if (!done[i] && ((m == -1) || (dist[i] < dist[m]))) m = i;
    }
    if (m == -1) return;
    if (s == 0) {
        if (dist[m] == ((1 << 20)-1)) {
            for (i = 0; i < 9; i++) SendA(1);
        }
        else {
            for (i = 0; i < 9; i++) SendA(((dist[m]-l) >> i) & 1);
        }
        s = 1;
    }
    else if (s == 1) {
        if (x == 0) s = 2;
        else {
            int u = 0;
            for (i = 0; i < m; i++) {
                if (!done[i]) u++;
            }
            for (i = 0; i < 11; i++) SendA((u >> i) & 1);
            l = dist[m];
            s = 3;
        }
    }
    else if (s == 2) {
        num |= (x << c),c++;
        if (c == 20) {
            int u = num >> 9;
            for (i = 0; i < N; i++) {
                if (!done[i]) {
                    if (u == 0) break;
                    else u--;
                }
            }
            u = i;
            dist[u] = (num & ((1 << 9)-1))+l;
            l += (num & ((1 << 9)-1)),s = 3;
            m = u;
            c = num = 0;
        }
    }
    if (s == 3) {
        done[m] = 1;
        for (i = 0; i < adjList[m].size(); i++) {
            int v = adjList[m][i].first;
            dist[v] = min(dist[v],dist[m]+adjList[m][i].second);
        }
        s = 0;

        m = -1;
        for (i = 0; i < N; i++) {
            if (!done[i] && ((m == -1) || (dist[i] < dist[m]))) m = i;
        }
        if (m == -1) return;
        if (dist[m] == ((1 << 20)-1)) {
            for (i = 0; i < 9; i++) SendA(1);
        }
        else {
            for (i = 0; i < 9; i++) SendA(((dist[m]-l) >> i) & 1);
        }
        s = 1;
    }
}
vector<int> Answer() {
    int i;
    vi ans;
    for (i = 0; i < N; i++) ans.pb(dist[i]);
    return ans;
}

#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 ----------
#include "Baijan.h"

namespace {
    int N;
    vpii adjList[2000];
    int dist[2000],done[2000];
    int num,c = 0,s = 0,l = 0;
}

void InitB(int N,int B,vector<int> S,vector<int> T,vector<int> D) {
    int i;
    ::N = N;
    for (i = 0; i < N; i++) dist[i] = (1 << 20)-1,done[i] = 0;
    for (i = 0; i < B; i++) {
        adjList[S[i]].pb(mp(T[i],D[i]));
        adjList[T[i]].pb(mp(S[i],D[i]));
    }
    dist[0] = 0,done[0] = 1;
    for (i = 0; i < adjList[0].size(); i++) dist[adjList[0][i].first] = adjList[0][i].second;
    SendB(0);
}
void ReceiveB(bool y) {
    int i,m = -1;
    for (i = 0; i < N; i++) {
        if (!done[i] && ((m == -1) || (dist[i] < dist[m]))) m = i;
    }
    if (s == 0) {
        num |= (y << c),c++;
        if (c == 9) {
            if ((l+(num & ((1 << 9)-1))) < dist[m]) SendB(1),s = 1;
            else {
                SendB(0);
                for (i = 0; i < 9; i++) SendB(((dist[m]-l) >> i) & 1);
                int u = 0;
                for (i = 0; i < m; i++) {
                    if (!done[i]) u++;
                }
                for (i = 0; i < 11; i++) SendB((u >> i) & 1);
                l = dist[m];
                s = 3;
                c = num = 0;
            }
        }
    }
    else if (s == 1) {
        num |= (y << c),c++;
        if (c == 20) {
            int u = num >> 9;
            for (i = 0; i < N; i++) {
                if (!done[i]) {
                    if (u == 0) break;
                    else u--;
                }
            }
            u = i;
            dist[u] = (num & ((1 << 9)-1))+l;
            l += (num & ((1 << 9)-1)),s = 3;
            m = u;
            c = num = 0;
        }
    }
    if (s == 3) {
        done[m] = 1;
        for (i = 0; i < adjList[m].size(); i++) {
            int v = adjList[m][i].first;
            dist[v] = min(dist[v],dist[m]+adjList[m][i].second);
        }
        s = 0;
    }
}

Compilation message

Azer.cpp: In function 'void InitA(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
Azer.cpp:75:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[0].size(); i++) dist[adjList[0][i].first] = adjList[0][i].second;
                 ~~^~~~~~~~~~~~~~~~~~~
Azer.cpp: In function 'void ReceiveA(bool)':
Azer.cpp:123:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[m].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~

Baijan.cpp: In function 'void InitB(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
Baijan.cpp:75:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[0].size(); i++) dist[adjList[0][i].first] = adjList[0][i].second;
                 ~~^~~~~~~~~~~~~~~~~~~
Baijan.cpp: In function 'void ReceiveB(bool)':
Baijan.cpp:120:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[m].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 792 ms 756 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1400 KB Output is correct
2 Correct 1498 ms 1560 KB Output is correct
3 Correct 1474 ms 1768 KB Output is correct
4 Correct 1680 ms 55176 KB Output is correct
5 Correct 1522 ms 48320 KB Output is correct
6 Correct 248 ms 1768 KB Output is correct
7 Correct 1818 ms 48520 KB Output is correct

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1248 ms 1520 KB Output is correct
2 Correct 4 ms 968 KB Output is correct
3 Incorrect 722 ms 744 KB Wrong Answer [2]
4 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 402 ms 1584 KB Output is correct
2 Correct 542 ms 1504 KB Output is correct
3 Correct 722 ms 23680 KB Output is correct
4 Correct 575 ms 1768 KB Output is correct
5 Correct 700 ms 17192 KB Output is correct
6 Correct 506 ms 1600 KB Output is correct
7 Correct 536 ms 1432 KB Output is correct
8 Correct 391 ms 1632 KB Output is correct
9 Correct 810 ms 36080 KB Output is correct
10 Correct 844 ms 36024 KB Output is correct
11 Correct 1232 ms 60968 KB Output is correct
12 Correct 1020 ms 53512 KB Output is correct
13 Correct 520 ms 1504 KB Output is correct
14 Correct 4 ms 1248 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 402 ms 1584 KB Output is correct
2 Correct 542 ms 1504 KB Output is correct
3 Correct 722 ms 23680 KB Output is correct
4 Correct 575 ms 1768 KB Output is correct
5 Correct 700 ms 17192 KB Output is correct
6 Correct 506 ms 1600 KB Output is correct
7 Correct 536 ms 1432 KB Output is correct
8 Correct 391 ms 1632 KB Output is correct
9 Correct 810 ms 36080 KB Output is correct
10 Correct 844 ms 36024 KB Output is correct
11 Correct 1232 ms 60968 KB Output is correct
12 Correct 1020 ms 53512 KB Output is correct
13 Correct 520 ms 1504 KB Output is correct
14 Correct 4 ms 1248 KB Output is correct
15 Correct 648 ms 1760 KB Output is correct
16 Correct 544 ms 1344 KB Output is correct
17 Correct 576 ms 1768 KB Output is correct
18 Correct 1041 ms 17624 KB Output is correct
19 Correct 706 ms 1600 KB Output is correct
20 Correct 1002 ms 17808 KB Output is correct
21 Correct 698 ms 1760 KB Output is correct
22 Correct 576 ms 1688 KB Output is correct
23 Correct 882 ms 44216 KB Output is correct
24 Correct 1022 ms 43680 KB Output is correct
25 Correct 1540 ms 75208 KB Output is correct
26 Correct 1299 ms 64192 KB Output is correct
27 Correct 810 ms 1760 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 402 ms 1584 KB Output is correct
2 Correct 542 ms 1504 KB Output is correct
3 Correct 722 ms 23680 KB Output is correct
4 Correct 575 ms 1768 KB Output is correct
5 Correct 700 ms 17192 KB Output is correct
6 Correct 506 ms 1600 KB Output is correct
7 Correct 536 ms 1432 KB Output is correct
8 Correct 391 ms 1632 KB Output is correct
9 Correct 810 ms 36080 KB Output is correct
10 Correct 844 ms 36024 KB Output is correct
11 Correct 1232 ms 60968 KB Output is correct
12 Correct 1020 ms 53512 KB Output is correct
13 Correct 520 ms 1504 KB Output is correct
14 Correct 4 ms 1248 KB Output is correct
15 Correct 648 ms 1760 KB Output is correct
16 Correct 544 ms 1344 KB Output is correct
17 Correct 576 ms 1768 KB Output is correct
18 Correct 1041 ms 17624 KB Output is correct
19 Correct 706 ms 1600 KB Output is correct
20 Correct 1002 ms 17808 KB Output is correct
21 Correct 698 ms 1760 KB Output is correct
22 Correct 576 ms 1688 KB Output is correct
23 Correct 882 ms 44216 KB Output is correct
24 Correct 1022 ms 43680 KB Output is correct
25 Correct 1540 ms 75208 KB Output is correct
26 Correct 1299 ms 64192 KB Output is correct
27 Correct 810 ms 1760 KB Output is correct
28 Correct 880 ms 1576 KB Output is correct
29 Correct 878 ms 1512 KB Output is correct
30 Correct 1422 ms 42152 KB Output is correct
31 Correct 872 ms 1496 KB Output is correct
32 Correct 1436 ms 37320 KB Output is correct
33 Correct 960 ms 1848 KB Output is correct
34 Correct 932 ms 1768 KB Output is correct
35 Correct 964 ms 1696 KB Output is correct
36 Correct 1176 ms 49024 KB Output is correct
37 Correct 1344 ms 49264 KB Output is correct
38 Correct 1868 ms 85432 KB Output is correct
39 Correct 1700 ms 78440 KB Output is correct
40 Correct 800 ms 1976 KB Output is correct

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 792 ms 756 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -