oj.uz

답안 #514907

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
514907 2022-01-18T18:54:06 Z 600Mihnea 저장 (Saveit) (IOI10_saveit) C++17
0 / 100
 324 ms 10864 KB 
#include "grader.h"
#include "encoder.h"
#include <bits/stdc++.h>

using namespace std;

void encode(int nv, int nh, int ne, int *v1, int *v2) {
  const int STORING_BITS = 10;

  vector<vector<int>> g(nv);
  vector<int> parrent(nv, -2);
  vector<bool> vis(nv, 0);
  for (int i = 0; i < ne; i++) {
    g[v1[i]].push_back(v2[i]);
    g[v2[i]].push_back(v1[i]);
  }
  function<void(int)> dfs = [&] (int a) {
    vis[a] = 1;
    for (auto &b : g[a]) {
      if (!vis[b]) {
        parrent[b] = a;
        dfs(b);
      }
    }
  };
  parrent[0] = -1;
  dfs(0);
  int cnt = 0;
  for (int i = 1; i < nv; i++) {
    for (int bit = 0; bit < STORING_BITS; bit++) {
      if (parrent[i] & (1 << bit)) {
        encode_bit(1);
        cnt++;
      } else {
        encode_bit(0);
        cnt++;
      }
    }
  }
  vector<int> stored;
  for (int i = 0; i < nh; i++) {
    /// calculate the dist from vertex i
    vector<int> d(nv, -1);
    queue<int> q;
    q.push(i);
    d[i] = 0;
    while (!q.empty()) {
      int a = q.front();
      q.pop();
      for (auto &b : g[a]) {
        if (d[b] == -1) {
          d[b] = 1 + d[a];
          q.push(b);
        }
      }
    }
    for (int i = 0; i < nv; i++) {
      assert(d[i] != -1);
    }
    for (int i = 1; i < nv; i++) {
      int dif = d[i] - d[parrent[i]];
      assert(-1 <= dif && dif <= +1);
      stored.push_back(dif + 1);
    }
    continue;
    cout << " : ";
    for (int i = 0; i < nv; i++) {
      cout << d[i] << " ";
    }
    cout << "\n";
  }

  for (auto &send : stored) {
    assert(0 <= send && send <= 2);
    if (send == 0) {
      encode_bit(0);
      encode_bit(0);
    }
    if (send == 1) {
      encode_bit(0);
      encode_bit(1);
    }
    if (send == 2) {
      encode_bit(1);
      encode_bit(0);
    }
  }
  return;
  assert((int) stored.size() == nh * (nv - 1));
  for (int i = 0; i < nv; i++) {
    cout << i << " : " << parrent[i] << "\n";
  }
  cout << " = ";
  for (auto &x : stored) {
    cout << x << " ";
  }
  cout << "\n";
  return;
  exit(0);
  encode_bit(1);
  encode_bit(0);
  return;
}


#include "grader.h"
#include "decoder.h"
#include <bits/stdc++.h>

using namespace std;

void decode(int nv, int nh) {
  const int STORING_BITS = 10;
  vector<int> parrent(nv, 0);
  parrent[0] = -1;
  for (int i = 1; i < nv; i++) {
    for (int bit = 0; bit < STORING_BITS; bit++) {
      int x = decode_bit();
      parrent[i] += (1 << bit) * x;
    }
  }

  vector<int> stored(nh * (nv - 1));
  for (int i = 0; i < (int) stored.size(); i++) {
    int a = decode_bit();
    int b = decode_bit();
    if (a == 0) {
      stored[i] = b;
    } else {
      stored[i] = 2;
    }
  }
  int po = 0;
  for (int r = 0; r < nh; r++) {
    /// calculate the dist from vertex i
    vector<vector<pair<int, int>>> g(nv);
    for (int i = 1; i < nv; i++) {
      int dif = stored[po++] - 1;
      int j = parrent[i];
      g[i].push_back({j, dif});
      g[j].push_back({i, -dif});
    }
    const int TOKEN = -(int) 1e9;
    vector<int> sol(nv, TOKEN);
    sol[r] = 0;
    function<void(int)> explore = [&] (int a) {
      for (auto &b : g[a]) {
        if (sol[b.first] == TOKEN) {
          sol[b.first] = sol[a] - b.second;
          explore(b.first);
        }
      }
    };
    explore(r);
    for (int i = 0; i < nv; i++) {
      hops(r, i, sol[i]);
    }
  }
  return;
  exit(0);

  cout << "aici\n";
  for (int i = 0; i < nv; i++) {
    cout << i << " : " << parrent[i] << "\n";
  }

  cout << " = ";
  for (auto &x : stored) {
    cout << x << " ";
  }
  cout << "\n";
  exit(0);
  int a = decode_bit();
  int b = decode_bit();
  hops(0,0,0);
  hops(1,2,3);
}

Compilation message

decoder.cpp: In function 'void decode(int, int)':
decoder.cpp:68:7: warning: unused variable 'a' [-Wunused-variable]
   68 |   int a = decode_bit();
      |       ^
decoder.cpp:69:7: warning: unused variable 'b' [-Wunused-variable]
   69 |   int b = decode_bit();
      |       ^

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 324 ms 10864 KB Output is partially correct - 81918 call(s) of encode_bit()
2 Correct 1 ms 4516 KB Output is correct - 64 call(s) of encode_bit()
3 Correct 28 ms 5816 KB Output is partially correct - 73718 call(s) of encode_bit()
4 Correct 2 ms 4580 KB Output is correct - 80 call(s) of encode_bit()
5 Correct 38 ms 5920 KB Output is partially correct - 73718 call(s) of encode_bit()
6 Correct 37 ms 5980 KB Output is partially correct - 81918 call(s) of encode_bit()
7 Correct 52 ms 6400 KB Output is partially correct - 81918 call(s) of encode_bit()
8 Correct 25 ms 5768 KB Output is partially correct - 78720 call(s) of encode_bit()
9 Correct 32 ms 5840 KB Output is partially correct - 81918 call(s) of encode_bit()
10 Correct 27 ms 5872 KB Output is partially correct - 81918 call(s) of encode_bit()
11 Correct 39 ms 6004 KB Output is partially correct - 81918 call(s) of encode_bit()
12 Correct 25 ms 5872 KB Output is partially correct - 81918 call(s) of encode_bit()
13 Correct 57 ms 6596 KB Output is partially correct - 81918 call(s) of encode_bit()
14 Correct 32 ms 5924 KB Output is partially correct - 81918 call(s) of encode_bit()
15 Correct 28 ms 6024 KB Output is partially correct - 81918 call(s) of encode_bit()
16 Correct 51 ms 6348 KB Output is partially correct - 81918 call(s) of encode_bit()
17 Correct 57 ms 6396 KB Output is partially correct - 81918 call(s) of encode_bit()
18 Correct 51 ms 6692 KB Output is partially correct - 81918 call(s) of encode_bit()
19 Correct 48 ms 6204 KB Output is partially correct - 81918 call(s) of encode_bit()
20 Correct 64 ms 6924 KB Output is partially correct - 81918 call(s) of encode_bit()
21 Correct 96 ms 6972 KB Output is partially correct - 81918 call(s) of encode_bit()
22 Correct 70 ms 6672 KB Output is partially correct - 81918 call(s) of encode_bit()
23 Correct 79 ms 7200 KB Output is partially correct - 81918 call(s) of encode_bit()

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 324 ms 10864 KB Output is partially correct - 81918 call(s) of encode_bit()
2 Correct 1 ms 4516 KB Output is correct - 64 call(s) of encode_bit()
3 Correct 28 ms 5816 KB Output is partially correct - 73718 call(s) of encode_bit()
4 Correct 2 ms 4580 KB Output is correct - 80 call(s) of encode_bit()
5 Correct 38 ms 5920 KB Output is partially correct - 73718 call(s) of encode_bit()
6 Correct 37 ms 5980 KB Output is partially correct - 81918 call(s) of encode_bit()
7 Correct 52 ms 6400 KB Output is partially correct - 81918 call(s) of encode_bit()
8 Correct 25 ms 5768 KB Output is partially correct - 78720 call(s) of encode_bit()
9 Correct 32 ms 5840 KB Output is partially correct - 81918 call(s) of encode_bit()
10 Correct 27 ms 5872 KB Output is partially correct - 81918 call(s) of encode_bit()
11 Correct 39 ms 6004 KB Output is partially correct - 81918 call(s) of encode_bit()
12 Correct 25 ms 5872 KB Output is partially correct - 81918 call(s) of encode_bit()
13 Correct 57 ms 6596 KB Output is partially correct - 81918 call(s) of encode_bit()
14 Correct 32 ms 5924 KB Output is partially correct - 81918 call(s) of encode_bit()
15 Correct 28 ms 6024 KB Output is partially correct - 81918 call(s) of encode_bit()
16 Correct 51 ms 6348 KB Output is partially correct - 81918 call(s) of encode_bit()
17 Correct 57 ms 6396 KB Output is partially correct - 81918 call(s) of encode_bit()
18 Correct 51 ms 6692 KB Output is partially correct - 81918 call(s) of encode_bit()
19 Correct 48 ms 6204 KB Output is partially correct - 81918 call(s) of encode_bit()
20 Correct 64 ms 6924 KB Output is partially correct - 81918 call(s) of encode_bit()
21 Correct 96 ms 6972 KB Output is partially correct - 81918 call(s) of encode_bit()
22 Correct 70 ms 6672 KB Output is partially correct - 81918 call(s) of encode_bit()
23 Correct 79 ms 7200 KB Output is partially correct - 81918 call(s) of encode_bit()

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 324 ms 10864 KB Output is partially correct - 81918 call(s) of encode_bit()
2 Correct 1 ms 4516 KB Output is correct - 64 call(s) of encode_bit()
3 Correct 28 ms 5816 KB Output is partially correct - 73718 call(s) of encode_bit()
4 Correct 2 ms 4580 KB Output is correct - 80 call(s) of encode_bit()
5 Correct 38 ms 5920 KB Output is partially correct - 73718 call(s) of encode_bit()
6 Correct 37 ms 5980 KB Output is partially correct - 81918 call(s) of encode_bit()
7 Correct 52 ms 6400 KB Output is partially correct - 81918 call(s) of encode_bit()
8 Correct 25 ms 5768 KB Output is partially correct - 78720 call(s) of encode_bit()
9 Correct 32 ms 5840 KB Output is partially correct - 81918 call(s) of encode_bit()
10 Correct 27 ms 5872 KB Output is partially correct - 81918 call(s) of encode_bit()
11 Correct 39 ms 6004 KB Output is partially correct - 81918 call(s) of encode_bit()
12 Correct 25 ms 5872 KB Output is partially correct - 81918 call(s) of encode_bit()
13 Correct 57 ms 6596 KB Output is partially correct - 81918 call(s) of encode_bit()
14 Correct 32 ms 5924 KB Output is partially correct - 81918 call(s) of encode_bit()
15 Correct 28 ms 6024 KB Output is partially correct - 81918 call(s) of encode_bit()
16 Correct 51 ms 6348 KB Output is partially correct - 81918 call(s) of encode_bit()
17 Correct 57 ms 6396 KB Output is partially correct - 81918 call(s) of encode_bit()
18 Correct 51 ms 6692 KB Output is partially correct - 81918 call(s) of encode_bit()
19 Correct 48 ms 6204 KB Output is partially correct - 81918 call(s) of encode_bit()
20 Correct 64 ms 6924 KB Output is partially correct - 81918 call(s) of encode_bit()
21 Correct 96 ms 6972 KB Output is partially correct - 81918 call(s) of encode_bit()
22 Correct 70 ms 6672 KB Output is partially correct - 81918 call(s) of encode_bit()
23 Correct 79 ms 7200 KB Output is partially correct - 81918 call(s) of encode_bit()

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 324 ms 10864 KB Output is partially correct - 81918 call(s) of encode_bit()
2 Correct 1 ms 4516 KB Output is correct - 64 call(s) of encode_bit()
3 Correct 28 ms 5816 KB Output is partially correct - 73718 call(s) of encode_bit()
4 Correct 2 ms 4580 KB Output is correct - 80 call(s) of encode_bit()
5 Correct 38 ms 5920 KB Output is partially correct - 73718 call(s) of encode_bit()
6 Correct 37 ms 5980 KB Output is partially correct - 81918 call(s) of encode_bit()
7 Correct 52 ms 6400 KB Output is partially correct - 81918 call(s) of encode_bit()
8 Correct 25 ms 5768 KB Output is partially correct - 78720 call(s) of encode_bit()
9 Correct 32 ms 5840 KB Output is partially correct - 81918 call(s) of encode_bit()
10 Correct 27 ms 5872 KB Output is partially correct - 81918 call(s) of encode_bit()
11 Correct 39 ms 6004 KB Output is partially correct - 81918 call(s) of encode_bit()
12 Correct 25 ms 5872 KB Output is partially correct - 81918 call(s) of encode_bit()
13 Correct 57 ms 6596 KB Output is partially correct - 81918 call(s) of encode_bit()
14 Correct 32 ms 5924 KB Output is partially correct - 81918 call(s) of encode_bit()
15 Correct 28 ms 6024 KB Output is partially correct - 81918 call(s) of encode_bit()
16 Correct 51 ms 6348 KB Output is partially correct - 81918 call(s) of encode_bit()
17 Correct 57 ms 6396 KB Output is partially correct - 81918 call(s) of encode_bit()
18 Correct 51 ms 6692 KB Output is partially correct - 81918 call(s) of encode_bit()
19 Correct 48 ms 6204 KB Output is partially correct - 81918 call(s) of encode_bit()
20 Correct 64 ms 6924 KB Output is partially correct - 81918 call(s) of encode_bit()
21 Correct 96 ms 6972 KB Output is partially correct - 81918 call(s) of encode_bit()
22 Correct 70 ms 6672 KB Output is partially correct - 81918 call(s) of encode_bit()
23 Correct 79 ms 7200 KB Output is partially correct - 81918 call(s) of encode_bit()