oj.uz

Submission #122845

# Submission time Handle Problem Language Result Execution time Memory
122845 2019-06-29T10:58:45 Z Plurm Two Transportations (JOI19_transportations) C++14
0 / 100
 666 ms 55056 KB 
#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;

namespace {
    class state{
    public:
        int u;
        int w;
        state(int x, int y) : u(x), w(y) {}
        friend bool operator<(state x, state y){
            return x.w > y.w;
        }
    };
    int N;
    vector<pair<int, int> > g[2048];
    int dist[2048];
    vector<bool> cur;
    void computeShortestPath(){
        for(int i = 1; i < N; i++){
            dist[i] = 1 << 20;
        }
        dist[0] = 0;
        priority_queue<state> pq;
        pq.emplace(0,0);
        while(!pq.empty()){
            state curr = pq.top();
            pq.pop();
            for(auto v : g[curr.u]){
                if(dist[v.first] > curr.w + v.second){
                    dist[v.first] = curr.w + v.second;
                    pq.emplace(v.first, dist[v.first]);
                }
            }
        }
    }
    int B = -1;
}

void InitA(int N, int A, vector<int> U, vector<int> V,
           vector<int> C) {
    ::N = N;
    for(int i = 0; i < A; i++){
        g[U[i]].emplace_back(V[i], C[i]);
        g[V[i]].emplace_back(U[i], C[i]);
    }
}

void ReceiveA(bool x) {
    cur.push_back(x);
    if(B == -1 && cur.size() == 10){
        B = 0;
        for(int i = 0; i < 10; i++){
            if(cur[i]) B += 1 << i;
        }
        cur.clear();
        return;
    }
    if(cur.size() % 31 == 0){
        int w = 0;
        for(int i = cur.size()-31; i < cur.size()-22; i++){
            if(cur[i]) w += 1 << (i+31-cur.size());
        }
        int u = 0;
        for(int i = cur.size()-22; i < cur.size()-11; i++){
            if(cur[i]) u += 1 << (i+22-cur.size());
        }
        int v = 0;
        for(int i = cur.size()-11; i < cur.size(); i++){
            if(cur[i]) v += 1 << (i+11-cur.size());
        }
        g[u].emplace_back(v,w);
        g[v].emplace_back(u,w);
    }
    if(cur.size() == B * 31) computeShortestPath();
}

vector<int> Answer() {
    vector<int> ans;
    for(int i = 0; i < N; i++){
        ans.push_back(dist[i]);
    }
    return ans;
}

#include "Baijan.h"
#include <bits/stdc++.h>
using namespace std;

namespace {
    int N;
}

void InitB(int N, int B, std::vector<int> S, std::vector<int> T,
           std::vector<int> D) {
    ::N = N;
    for(int i = 0; i < 10; i++){
        if(B & (1 << i)) SendB(true);
        else SendB(false);
    }
    for(int i = 0; i < B; i++){
        for(int j = 0; j < 9; j++){
            if(D[i] & (1 << j)) SendB(true);
            else SendB(false);
        }
        for(int j = 0; j < 11; j++){
            if(S[i] & (1 << j)) SendB(true);
            else SendB(false);
        }
        for(int j = 0; j < 11; j++){
            if(T[i] & (1 << j)) SendB(true);
            else SendB(false);
        }
    }
}

void ReceiveB(bool y) {
}
/*
4 3 4
0 1 6
2 1 4
2 0 10
1 2 3
3 1 1
3 2 3
3 0 7
 */

Compilation message

Azer.cpp: In function 'void ReceiveA(bool)':
Azer.cpp:61:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = cur.size()-31; i < cur.size()-22; i++){
                                    ~~^~~~~~~~~~~~~~~
Azer.cpp:65:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = cur.size()-22; i < cur.size()-11; i++){
                                    ~~^~~~~~~~~~~~~~~
Azer.cpp:69:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = cur.size()-11; i < cur.size(); i++){
                                    ~~^~~~~~~~~~~~
Azer.cpp:75:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(cur.size() == B * 31) computeShortestPath();
        ~~~~~~~~~~~^~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 708 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 992 KB Output is correct
2 Correct 541 ms 1384 KB Output is correct
3 Correct 284 ms 1760 KB Output is correct
4 Correct 666 ms 55056 KB Output is correct
5 Incorrect 424 ms 47984 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 428 ms 1400 KB Output is correct
2 Correct 4 ms 1120 KB Output is correct
3 Incorrect 10 ms 752 KB Wrong Answer [2]
4 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 1192 KB Output is correct
2 Correct 254 ms 1504 KB Output is correct
3 Incorrect 112 ms 8328 KB Wrong Answer [2]
4 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 1192 KB Output is correct
2 Correct 254 ms 1504 KB Output is correct
3 Incorrect 112 ms 8328 KB Wrong Answer [2]
4 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 1192 KB Output is correct
2 Correct 254 ms 1504 KB Output is correct
3 Incorrect 112 ms 8328 KB Wrong Answer [2]
4 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 708 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -