oj.uz

Submission #39962

# Submission time Handle Problem Language Result Execution time Memory
39962 2018-01-25T04:22:16 Z funcsr Factories (JOI14_factories) C++14
15 / 100
 6000 ms 69736 KB 
#include "factories.h"
#include <iostream>
#include <queue>
#include <cassert>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<long long, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define index(x, y) (int)(lower_bound(all(x), y) - x.begin())
#define pb push_back
#define _1 first
#define _2 second
#define INF (1LL<<60)

int N;
vector<P> G[500000];
long long D[500000];
void Init(int NN, int A[], int B[], int D[]) {
  N = NN;
  rep(i, N-1) {
    G[A[i]].pb(P(B[i], D[i]));
    G[B[i]].pb(P(A[i], D[i]));
  }
}

long long Query(int S, int X[], int T, int Y[]) {
  //cout<<"query {"; rep(i, S) cout<<X[i]<<",";cout<<"}, {";rep(i, T) cout<<Y[i]<<",";cout<<"}\n";
  rep(i, N) D[i] = INF;
  priority_queue<P, vector<P>, greater<P> > q;
  rep(i, S) q.push(P(0, X[i])), D[X[i]] = 0;
  while (!q.empty()) {
    long long r = q.top()._1;
    int x = q.top()._2;
    q.pop();
    if (D[x] < r) continue;
    for (P p : G[x]) {
      int t = p._1, len = p._2;
      if (D[t] > r+len) {
        D[t] = r+len;
        q.push(P(D[t], t));
      }
    }
  }
  long long s = INF;
  rep(i, T) s = min(s, D[Y[i]]);
  return s;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 39912 KB Output is correct
2 Correct 4006 ms 40308 KB Output is correct
3 Correct 3860 ms 40176 KB Output is correct
4 Correct 3125 ms 40516 KB Output is correct
5 Correct 2382 ms 40308 KB Output is correct
6 Correct 3969 ms 40536 KB Output is correct
7 Correct 4016 ms 40176 KB Output is correct
8 Correct 3775 ms 40176 KB Output is correct
9 Correct 2410 ms 40308 KB Output is correct
10 Correct 4072 ms 40536 KB Output is correct
11 Correct 3936 ms 40176 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 39912 KB Output is correct
2 Execution timed out 6000 ms 67692 KB Execution timed out
3 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6000 ms 69736 KB Execution timed out
2 Halted 0 ms 0 KB -