oj.uz

Submission #591279

# Submission time Handle Problem Language Result Execution time Memory
591279 2022-07-07T08:14:38 Z 조영욱(#8419) Two Transportations (JOI19_transportations) C++17
6 / 100
 374 ms 10200 KB 
#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;

namespace {

int n;
int variable_example[500000];
int cnt;
int ret[2000];

}  // namespace

void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
           std::vector<int> C) {
               n=N;
               memset(ret,0,sizeof(ret));
}

void ReceiveA(bool x) {
    ret[cnt/20+1]+=(x<<(cnt%20));
    cnt++;
}

std::vector<int> Answer() {
  std::vector<int> ans(n);
  for (int k = 0; k < n; ++k) {
    ans[k] = ret[k];
  }
  return ans;
}

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

namespace {

int n,m;
int cnt;

bool FunctionExample(bool P) {
  return !P;
}
typedef pair<int,int> P;
vector<P> adj[2000];
bool vis[2000];
int dist[2000];
}  // namespace

void InitB(int N, int B, std::vector<int> S, std::vector<int> T,
           std::vector<int> D) {
  n=N;
  m=S.size();
  for(int i=0;i<m;i++) {
    adj[S[i]].push_back(P(T[i],D[i]));
    adj[T[i]].push_back(P(S[i],D[i]));
  }
  for(int i=0;i<n;i++){
    dist[i]=1e7;
  }
  priority_queue<P,vector<P>,greater<P>> pq;
  pq.push(P(0,0));
  dist[0]=0;
  memset(vis,0,sizeof(vis));
  while (!pq.empty()) {
    int now=pq.top().second;
    pq.pop();
    if (vis[now]) {
        continue;
    }
    vis[now]=true;
    for(int i=0;i<adj[now].size();i++) {
        int nt=adj[now][i].first;
        if (dist[nt]>dist[now]+adj[now][i].second) {
            dist[nt]=dist[now]+adj[now][i].second;
            pq.push(P(dist[nt],nt));
        }
    }
  }
  for(int i=1;i<n;i++) {
    for(int j=0;j<20;j++) {
        if (dist[i]&(1<<j)) {
            SendB(true);
        }
        else {
            SendB(false);
        }
    }
  }
}

void ReceiveB(bool y) {
  ++cnt;
  if (cnt < 58000) {
    SendB(FunctionExample(y));
    ++cnt;
  }
}

Compilation message

Azer.cpp:8:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
    8 | int variable_example[500000];
      |     ^~~~~~~~~~~~~~~~

Baijan.cpp: In function 'void InitB(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
Baijan.cpp:41:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for(int i=0;i<adj[now].size();i++) {
      |                 ~^~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 736 KB Output is correct
2 Correct 0 ms 528 KB Output is correct
3 Correct 230 ms 744 KB Output is correct
4 Correct 374 ms 10200 KB Output is correct
5 Correct 17 ms 784 KB Output is correct
6 Correct 142 ms 2288 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 528 KB Output is correct
2 Incorrect 230 ms 752 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

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

Subtask #4
0 / 38.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 736 KB Output is correct
2 Correct 0 ms 528 KB Output is correct
3 Correct 230 ms 744 KB Output is correct
4 Correct 374 ms 10200 KB Output is correct
5 Correct 17 ms 784 KB Output is correct
6 Correct 142 ms 2288 KB Output is correct
7 Correct 2 ms 528 KB Output is correct
8 Incorrect 230 ms 752 KB Output isn't correct
9 Halted 0 ms 0 KB -