oj.uz

Submission #428116

# Submission time Handle Problem Language Result Execution time Memory
428116 2021-06-15T08:10:30 Z juggernaut Two Transportations (JOI19_transportations) C++17
8 / 100
 506 ms 27452 KB 
#include"Azer.h"
#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int>>g[2005];
int dist[2005],n,shift;
void InitA(int n,int a,vector<int>u,vector<int>v,vector<int>c){
    ::n=n;
    for(int i=0;i<a;i++){
        int &x=u[i];
        int &y=v[i];
        int &w=c[i];
        g[x].emplace_back(y,w);
        g[y].emplace_back(x,w);
    }
}
queue<bool>q;
void ReceiveA(bool flag){
    q.push(flag);
    shift++;
    if(shift==31){
        int x=0,y=0,z=0;
        shift=0;
        for(int i=0;i<11;i++){
            x|=(q.front()<<i);
            q.pop();
        }
        for(int i=0;i<11;i++){
            y|=(q.front()<<i);
            q.pop();
        }
        for(int i=0;i<9;i++){
            z|=(q.front()<<i);
            q.pop();
        }
        g[x].emplace_back(y,z);
        g[y].emplace_back(x,z);
    }
}
vector<int>Answer(){
    for(int i=0;i<n;i++)dist[i]=2e9;
    dist[0]=0;
    priority_queue<pair<int,int>>q;
    q.push({0,0});
    while(!q.empty()){
        int w=q.top().first;
        int v=q.top().second;
        q.pop();
        if(-w>dist[v])continue;
        for(auto [to,w]:g[v])if(dist[to]>dist[v]+w){
            dist[to]=dist[v]+w;
            q.push({-dist[to],to});
        }
    }
    vector<int>vec;
    for(int i=0;i<n;i++)vec.push_back(dist[i]);
    return vec;
}

#include"Baijan.h"
#include<bits/stdc++.h>
using namespace std;
void InitB(int n,int b,vector<int>s,vector<int>t,vector<int>d){
    for(int i=0;i<b;i++){
        int &x=s[i];
        int &y=t[i];
        int &w=d[i];
        for(int j=0;j<11;j++)SendB(x>>j&1);
        for(int j=0;j<11;j++)SendB(y>>j&1);
        for(int j=0;j<9;j++)SendB(w>>j&1);
    }
}
void ReceiveB(bool y){
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 320 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 435 ms 728 KB Output is correct
3 Correct 486 ms 796 KB Output is correct
4 Correct 506 ms 27452 KB Output is correct
5 Correct 183 ms 24128 KB Output is correct
6 Correct 310 ms 676 KB Output is correct
7 Correct 482 ms 24200 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 338 ms 856 KB Output is correct
2 Correct 2 ms 516 KB Output is correct
3 Runtime error 0 ms 324 KB Execution killed with signal 13
4 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 672 KB Output is correct
2 Correct 200 ms 668 KB Output is correct
3 Runtime error 37 ms 6584 KB Execution killed with signal 13
4 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 672 KB Output is correct
2 Correct 200 ms 668 KB Output is correct
3 Runtime error 37 ms 6584 KB Execution killed with signal 13
4 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 672 KB Output is correct
2 Correct 200 ms 668 KB Output is correct
3 Runtime error 37 ms 6584 KB Execution killed with signal 13
4 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 320 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -