oj.uz

답안 #120178

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
120178 2019-06-23T16:25:29 Z KLPP Two Transportations (JOI19_transportations) C++14
6 / 100
 958 ms 21376 KB 
#include "Azer.h"
#include <vector>
#include<bits/stdc++.h>



using namespace std;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
int n_A;
vector<pii > nei_A[2000];
vector<int> distanc;
int cnt;
int curr;
void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
           std::vector<int> C) {
  n_A=N;
  cnt=0;
  curr=0;
}

void ReceiveA(bool x) {
  if(x)curr+=(1<<cnt);
  cnt++;
  if(cnt==25){
    //cout<<curr<<endl;
    distanc.push_back(curr);
    curr=0;
    cnt=0;
  }
}

std::vector<int> Answer() {
  return distanc;
}
#include "Baijan.h"
#include <vector>
#include<bits/stdc++.h>



using namespace std;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
int n;
vector<pii > nei[2000];
int dist[2000];
void InitB(int N, int B, std::vector<int> S, std::vector<int> T,
           std::vector<int> D) {
  n=N;
  rep(i,0,S.size()){
    nei[S[i]].push_back(pii(T[i],D[i]));
    nei[T[i]].push_back(pii(S[i],D[i]));
  }
  priority_queue<pii> pq;
  rep(i,0,n)dist[i]=100000000;
  dist[0]=0;
  pq.push(pii(0,0));
  while(!pq.empty()){
    pii x=pq.top();pq.pop();
    int u=x.first;
    int d=-x.second;
    if(d>dist[u])continue;
    trav(v,nei[u]){
      if(dist[v.first]>v.second+d){
	dist[v.first]=v.second+d;
	pq.push(pii(v.first,-dist[v.first]));
      }
    }
  }
  rep(i,0,n){
    //cout<<dist[i]<<endl;
    rep(j,0,25){
      if((dist[i]&(1<<j))>0){
	SendB(true);
      }else SendB(false);
    }
  }
}

void ReceiveB(bool y) {
  
}

Compilation message

Baijan.cpp: In function 'void InitB(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
Baijan.cpp:9:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i,a,b) for(int i=a;i<b;i++)
Baijan.cpp:17:7:
   rep(i,0,S.size()){
       ~~~~~~~~~~~~               
Baijan.cpp:17:3: note: in expansion of macro 'rep'
   rep(i,0,S.size()){
   ^~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 808 ms 1712 KB Output is correct
2 Correct 4 ms 960 KB Output is correct
3 Correct 848 ms 1792 KB Output is correct
4 Correct 958 ms 21376 KB Output is correct
5 Correct 28 ms 1600 KB Output is correct
6 Correct 514 ms 4952 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 992 KB Output is correct
2 Incorrect 820 ms 1608 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 910 ms 1632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 238 ms 1512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 238 ms 1512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 238 ms 1512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 808 ms 1712 KB Output is correct
2 Correct 4 ms 960 KB Output is correct
3 Correct 848 ms 1792 KB Output is correct
4 Correct 958 ms 21376 KB Output is correct
5 Correct 28 ms 1600 KB Output is correct
6 Correct 514 ms 4952 KB Output is correct
7 Correct 6 ms 992 KB Output is correct
8 Incorrect 820 ms 1608 KB Output isn't correct
9 Halted 0 ms 0 KB -