oj.uz

Submission #123304

# Submission time Handle Problem Language Result Execution time Memory
123304 2019-07-01T06:37:03 Z 송준혁(#3022) Two Transportations (JOI19_transportations) C++14
6 / 100
 918 ms 20744 KB 
#include <bits/stdc++.h>
#include "Azer.h"
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;

static int N, M, num;
static vector<int> ans;

void InitA(int n, int A, vector<int> U, vector<int> V, vector<int> C){
    ans.resize(n);
}

void ReceiveA(bool x){
    if (x) ans[num/20] |= 1 << (num%20);
    num++;
}

vector<int> Answer() {
    return ans;
}

#include <bits/stdc++.h>
#include "Baijan.h"
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;

static int N, M, num, st;
static bool chk[2020];
static vector<pii> adj[2020];
static vector<int> ans;
static priority_queue<pii, vector<pii>, greater<pii>> PQ;

void InitB(int n, int B, vector<int> U, vector<int> V, vector<int> C) {
    N = n, M = B;
    PQ.push(pii(0, 0));
    ans.resize(N);

    for (int i=0; i<M; i++) {
        adj[U[i]].push_back(pii(V[i], C[i]));
        adj[V[i]].push_back(pii(U[i], C[i]));
    }

    while (!PQ.empty()){
        pii T = PQ.top();
        PQ.pop();
        if (chk[T.second]) continue;
        chk[T.second] = true;
        ans[T.second] = T.first;
        for (pii v : adj[T.second]) PQ.push(pii(v.second+T.first, v.first));
    }
    for (int i=0; i<N; i++) for (int j=0; j<20; j++) SendB(ans[i] & (1<<j));
}

void ReceiveB(bool y){
}

Compilation message

Azer.cpp:7:15: warning: 'M' defined but not used [-Wunused-variable]
 static int N, M, num;
               ^
Azer.cpp:7:12: warning: 'N' defined but not used [-Wunused-variable]
 static int N, M, num;
            ^

Baijan.cpp:7:23: warning: 'st' defined but not used [-Wunused-variable]
 static int N, M, num, st;
                       ^~
Baijan.cpp:7:18: warning: 'num' defined but not used [-Wunused-variable]
 static int N, M, num, st;
                  ^~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 490 ms 1840 KB Output is correct
2 Correct 8 ms 1248 KB Output is correct
3 Correct 480 ms 1568 KB Output is correct
4 Correct 918 ms 20744 KB Output is correct
5 Correct 30 ms 1904 KB Output is correct
6 Correct 532 ms 5576 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 976 KB Output is correct
2 Incorrect 676 ms 1640 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 622 ms 1544 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 246 ms 1504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 246 ms 1504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 246 ms 1504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 490 ms 1840 KB Output is correct
2 Correct 8 ms 1248 KB Output is correct
3 Correct 480 ms 1568 KB Output is correct
4 Correct 918 ms 20744 KB Output is correct
5 Correct 30 ms 1904 KB Output is correct
6 Correct 532 ms 5576 KB Output is correct
7 Correct 4 ms 976 KB Output is correct
8 Incorrect 676 ms 1640 KB Output isn't correct
9 Halted 0 ms 0 KB -