oj.uz

Submission #901333

# Submission time Handle Problem Language Result Execution time Memory
901333 2024-01-09T10:45:11 Z nguyentunglam Two Transportations (JOI19_transportations) C++17
100 / 100
 532 ms 48892 KB 
#include "Azer.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;

const int M1 = 9, M2 = 11;

int loop;

namespace {

const int N = 2e3 + 10;
int n;
int pre;
int d[N];
bool mark[N];
vector<pair<int, int> > adj[N];

#define ii pair<int, int>
priority_queue<ii, vector<ii>, greater<ii> > q;

void init () {
  mark[0] = 1;
  d[0] = 0;
  for(int i = 1; i < n; i++) mark[i] = 0, d[i] = (1 << 20) - 1;
  for(auto &it : adj[0]) {
    int v, w; tie(v, w) = it;
    q.push({d[v] = w, v});
  }
}

void add_edge (int u, int v, int w) {
  adj[u].emplace_back(v, w);
  adj[v].emplace_back(u, w);
}

pair<int, int> nxt;

void add () {
  while (!q.empty() && mark[q.top().second]) q.pop();
  if (q.empty()) {
    nxt = make_pair((1 << 20) - 1, (1 << 11) - 1);
    for(int i = 0; i < M1; i++) SendA(1);
    return;
  }
  int cost, u; tie(cost, u) = q.top();
  nxt = make_pair(cost - pre, u);
  for(int i = 0; i < M1; i++) SendA(nxt.first >> i & 1);
}


void calc (int cost, int u) {
  mark[u] = 1;
  d[u] = cost + pre;
  pre = d[u];
  if (cost > 1e6) assert(0);
  for(auto &it : adj[u]) {
    int v, w; tie(v, w) = it;
    if (d[v] > d[u] + w) q.push({d[v] = d[u] + w, v});
  }
}
}  // namespace

void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
           std::vector<int> C) {
  ::n = N;
  for(int i = 0; i < N; i++) adj[i].clear();
  for (int i = 0; i < A; ++i) {
    ::add_edge(U[i], V[i], C[i]);
  }

  ::init();

  if (N > 1) ::add();

  Answer();
}

bool bitA[100];

int cntA, costB, uB;

bool curA;

void ReceiveA(bool x) {
  bitA[cntA++] = x;
  if (!curA && cntA == M1) {
    costB = 0;
    for(int i = 0; i < M1; i++) if (bitA[i]) costB |= (1 << i); // rec costB
//    cout << costB << " " << cntA << "#\n";
    if (nxt.first <= costB) {
      for(int i = 0; i < M2; i++) SendA(nxt.second >> i & 1); // send uA
      calc(nxt.first, nxt.second);
      if (++loop < ::n - 1) ::add();
    }
    else curA = 1;
    cntA = 0;
//    cout << costB << " " << curA <<  " #\n";
  }
  if (curA && cntA == M2) {
    uB = 0;
    for(int i = 0; i < M2; i++) if (bitA[i]) uB |= (1 << i); // rec uB
//    for(int i = 0; i < M2; i++) cout << bitA[i]; cout << endl;
//    cout << costB << " " << uB << "\n";
//    cout << curA << " " << cntA << "\n";
    calc(costB, uB);
    cntA = curA = 0;
    if (++loop < ::n - 1) ::add();
  }
}

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

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

const int M1 = 9, M2 = 11;

namespace {

const int N = 2e3 + 10;
int n;
int cnt, pre;
int d[N];
bool mark[N];
vector<pair<int, int> > adj[N];

#define ii pair<int, int>
priority_queue<ii, vector<ii>, greater<ii> > q;

void init () {
  mark[0] = 1;
  for(int i = 1; i < n; i++) mark[i] = 0, d[i] = (1 << 20) - 1;
  for(auto &it : adj[0]) {
    int v, w; tie(v, w) = it;
    q.push({d[v] = w, v});
  }
}

void add_edge (int u, int v, int w) {
  adj[u].emplace_back(v, w);
  adj[v].emplace_back(u, w);
}

pair<int, int> nxt;

void add () {
  while (!q.empty() && mark[q.top().second]) q.pop();
  if (q.empty()) {
    nxt = make_pair((1 << 20) - 1, (1 << 11) - 1);
    return;
  }
  int cost, u; tie(cost, u) = q.top();
  nxt = make_pair(cost - pre, u);
}


void calc (int cost, int u) {
  mark[u] = 1;
  d[u] = cost + pre;
  pre = d[u];
  for(auto &it : adj[u]) {
    int v, w; tie(v, w) = it;
    if (d[v] > d[u] + w) q.push({d[v] = d[u] + w, v});
  }
}
}  // namespace

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 < N; i++) adj[i].clear();
  for(int i = 0; i < B; i++) {
    ::add_edge(S[i], T[i], D[i]);
  }
  ::init();
}

bool bitB[100];

int cntB, costA, uA;

bool curB;

void ReceiveB(bool y) {
  bitB[cntB++] = y;
  if (!curB && cntB == M1) {
    costA = 0;
    ::add();
//    cout << nxt.first << " " << nxt.second << "@@\n";
    for(int i = 0; i < M1; i++) if (bitB[i]) costA |= (1 << i); // rec costA
//    cout << costA << "@\n";
//    cout << nxt.first << " SendcostB\n";
    for(int i = 0; i < M1; i++) SendB(nxt.first >> i & 1); // send costB
    if (costA <= nxt.first) curB = 1;
    else {
//      cout << nxt.second << " SendUB\n";
//      for(int i = 0; i < M2; i++) cout << (nxt.second >> i & 1); cout << "??" << endl;
      for(int i = 0; i < M2; i++) SendB(nxt.second >> i & 1); // send uB
      calc(nxt.first, nxt.second);
    }
    cntB = 0;
  }
  if (curB && cntB == M2) { // rec uA
    uA = 0;
    for(int i = 0; i < M2; i++) if (bitB[i]) uA |= (1 << i); // rec uA
    calc(costA, uA);
    cntB = curB = 0;
  }
}

Compilation message

Baijan.cpp:12:5: warning: '{anonymous}::cnt' defined but not used [-Wunused-variable]
   12 | int cnt, pre;
      |     ^~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 1060 KB Output is correct
2 Correct 1 ms 664 KB Output is correct
3 Correct 257 ms 1060 KB Output is correct
4 Correct 357 ms 10360 KB Output is correct
5 Correct 12 ms 920 KB Output is correct
6 Correct 263 ms 2324 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 664 KB Output is correct
2 Correct 285 ms 884 KB Output is correct
3 Correct 299 ms 948 KB Output is correct
4 Correct 391 ms 27772 KB Output is correct
5 Correct 417 ms 24212 KB Output is correct
6 Correct 52 ms 664 KB Output is correct
7 Correct 392 ms 24532 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 872 KB Output is correct
2 Correct 0 ms 664 KB Output is correct
3 Correct 285 ms 800 KB Output is correct
4 Correct 306 ms 880 KB Output is correct
5 Correct 282 ms 888 KB Output is correct
6 Correct 276 ms 868 KB Output is correct
7 Correct 251 ms 876 KB Output is correct
8 Correct 276 ms 804 KB Output is correct
9 Correct 277 ms 800 KB Output is correct
10 Correct 291 ms 936 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 828 KB Output is correct
2 Correct 114 ms 664 KB Output is correct
3 Correct 173 ms 13440 KB Output is correct
4 Correct 107 ms 664 KB Output is correct
5 Correct 188 ms 10060 KB Output is correct
6 Correct 118 ms 664 KB Output is correct
7 Correct 114 ms 664 KB Output is correct
8 Correct 115 ms 664 KB Output is correct
9 Correct 207 ms 18360 KB Output is correct
10 Correct 221 ms 18300 KB Output is correct
11 Correct 301 ms 35940 KB Output is correct
12 Correct 269 ms 30768 KB Output is correct
13 Correct 128 ms 664 KB Output is correct
14 Correct 0 ms 916 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 828 KB Output is correct
2 Correct 114 ms 664 KB Output is correct
3 Correct 173 ms 13440 KB Output is correct
4 Correct 107 ms 664 KB Output is correct
5 Correct 188 ms 10060 KB Output is correct
6 Correct 118 ms 664 KB Output is correct
7 Correct 114 ms 664 KB Output is correct
8 Correct 115 ms 664 KB Output is correct
9 Correct 207 ms 18360 KB Output is correct
10 Correct 221 ms 18300 KB Output is correct
11 Correct 301 ms 35940 KB Output is correct
12 Correct 269 ms 30768 KB Output is correct
13 Correct 128 ms 664 KB Output is correct
14 Correct 0 ms 916 KB Output is correct
15 Correct 162 ms 664 KB Output is correct
16 Correct 152 ms 664 KB Output is correct
17 Correct 156 ms 664 KB Output is correct
18 Correct 183 ms 10436 KB Output is correct
19 Correct 161 ms 664 KB Output is correct
20 Correct 214 ms 10560 KB Output is correct
21 Correct 157 ms 664 KB Output is correct
22 Correct 172 ms 664 KB Output is correct
23 Correct 293 ms 22588 KB Output is correct
24 Correct 316 ms 22232 KB Output is correct
25 Correct 392 ms 43660 KB Output is correct
26 Correct 375 ms 36392 KB Output is correct
27 Correct 189 ms 904 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 828 KB Output is correct
2 Correct 114 ms 664 KB Output is correct
3 Correct 173 ms 13440 KB Output is correct
4 Correct 107 ms 664 KB Output is correct
5 Correct 188 ms 10060 KB Output is correct
6 Correct 118 ms 664 KB Output is correct
7 Correct 114 ms 664 KB Output is correct
8 Correct 115 ms 664 KB Output is correct
9 Correct 207 ms 18360 KB Output is correct
10 Correct 221 ms 18300 KB Output is correct
11 Correct 301 ms 35940 KB Output is correct
12 Correct 269 ms 30768 KB Output is correct
13 Correct 128 ms 664 KB Output is correct
14 Correct 0 ms 916 KB Output is correct
15 Correct 162 ms 664 KB Output is correct
16 Correct 152 ms 664 KB Output is correct
17 Correct 156 ms 664 KB Output is correct
18 Correct 183 ms 10436 KB Output is correct
19 Correct 161 ms 664 KB Output is correct
20 Correct 214 ms 10560 KB Output is correct
21 Correct 157 ms 664 KB Output is correct
22 Correct 172 ms 664 KB Output is correct
23 Correct 293 ms 22588 KB Output is correct
24 Correct 316 ms 22232 KB Output is correct
25 Correct 392 ms 43660 KB Output is correct
26 Correct 375 ms 36392 KB Output is correct
27 Correct 189 ms 904 KB Output is correct
28 Correct 274 ms 664 KB Output is correct
29 Correct 256 ms 676 KB Output is correct
30 Correct 338 ms 24220 KB Output is correct
31 Correct 238 ms 796 KB Output is correct
32 Correct 359 ms 21308 KB Output is correct
33 Correct 237 ms 872 KB Output is correct
34 Correct 245 ms 900 KB Output is correct
35 Correct 237 ms 900 KB Output is correct
36 Correct 325 ms 24964 KB Output is correct
37 Correct 396 ms 24968 KB Output is correct
38 Correct 439 ms 48892 KB Output is correct
39 Correct 408 ms 44380 KB Output is correct
40 Correct 226 ms 1176 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 1060 KB Output is correct
2 Correct 1 ms 664 KB Output is correct
3 Correct 257 ms 1060 KB Output is correct
4 Correct 357 ms 10360 KB Output is correct
5 Correct 12 ms 920 KB Output is correct
6 Correct 263 ms 2324 KB Output is correct
7 Correct 0 ms 664 KB Output is correct
8 Correct 285 ms 884 KB Output is correct
9 Correct 299 ms 948 KB Output is correct
10 Correct 391 ms 27772 KB Output is correct
11 Correct 417 ms 24212 KB Output is correct
12 Correct 52 ms 664 KB Output is correct
13 Correct 392 ms 24532 KB Output is correct
14 Correct 258 ms 872 KB Output is correct
15 Correct 0 ms 664 KB Output is correct
16 Correct 285 ms 800 KB Output is correct
17 Correct 306 ms 880 KB Output is correct
18 Correct 282 ms 888 KB Output is correct
19 Correct 276 ms 868 KB Output is correct
20 Correct 251 ms 876 KB Output is correct
21 Correct 276 ms 804 KB Output is correct
22 Correct 277 ms 800 KB Output is correct
23 Correct 291 ms 936 KB Output is correct
24 Correct 122 ms 828 KB Output is correct
25 Correct 114 ms 664 KB Output is correct
26 Correct 173 ms 13440 KB Output is correct
27 Correct 107 ms 664 KB Output is correct
28 Correct 188 ms 10060 KB Output is correct
29 Correct 118 ms 664 KB Output is correct
30 Correct 114 ms 664 KB Output is correct
31 Correct 115 ms 664 KB Output is correct
32 Correct 207 ms 18360 KB Output is correct
33 Correct 221 ms 18300 KB Output is correct
34 Correct 301 ms 35940 KB Output is correct
35 Correct 269 ms 30768 KB Output is correct
36 Correct 128 ms 664 KB Output is correct
37 Correct 0 ms 916 KB Output is correct
38 Correct 162 ms 664 KB Output is correct
39 Correct 152 ms 664 KB Output is correct
40 Correct 156 ms 664 KB Output is correct
41 Correct 183 ms 10436 KB Output is correct
42 Correct 161 ms 664 KB Output is correct
43 Correct 214 ms 10560 KB Output is correct
44 Correct 157 ms 664 KB Output is correct
45 Correct 172 ms 664 KB Output is correct
46 Correct 293 ms 22588 KB Output is correct
47 Correct 316 ms 22232 KB Output is correct
48 Correct 392 ms 43660 KB Output is correct
49 Correct 375 ms 36392 KB Output is correct
50 Correct 189 ms 904 KB Output is correct
51 Correct 274 ms 664 KB Output is correct
52 Correct 256 ms 676 KB Output is correct
53 Correct 338 ms 24220 KB Output is correct
54 Correct 238 ms 796 KB Output is correct
55 Correct 359 ms 21308 KB Output is correct
56 Correct 237 ms 872 KB Output is correct
57 Correct 245 ms 900 KB Output is correct
58 Correct 237 ms 900 KB Output is correct
59 Correct 325 ms 24964 KB Output is correct
60 Correct 396 ms 24968 KB Output is correct
61 Correct 439 ms 48892 KB Output is correct
62 Correct 408 ms 44380 KB Output is correct
63 Correct 226 ms 1176 KB Output is correct
64 Correct 338 ms 1600 KB Output is correct
65 Correct 480 ms 26924 KB Output is correct
66 Correct 460 ms 23508 KB Output is correct
67 Correct 294 ms 1212 KB Output is correct
68 Correct 280 ms 1200 KB Output is correct
69 Correct 532 ms 47532 KB Output is correct
70 Correct 508 ms 39728 KB Output is correct
71 Correct 313 ms 5304 KB Output is correct
72 Correct 275 ms 1176 KB Output is correct