oj.uz

Submission #821785

# Submission time Handle Problem Language Result Execution time Memory
821785 2023-08-11T16:26:55 Z farhan132 Meetings (JOI19_meetings) C++17
29 / 100
 1826 ms 2132 KB 
#include "meetings.h"
#include <bits/stdc++.h>

using namespace std;
 
typedef int ll;
typedef double dd;
typedef pair<ll , ll> ii;
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

const ll N = 2005;
vector < ll > v[N];
ll col[N];

void dfs(ll s){
  if(col[s]) return;
  col[s] = 1;
  for(auto u : v[s]) dfs(u);
}

void solve(vector < ll > a){
  if(a.size() == 1) return;
  if(a.size() == 2){
    v[a[0]].pb(a[1]);
    v[a[1]].pb(a[0]);
    //cout << a[0] << ' ' << a[1] << " <- double" << '\n';
    return;
  }
  ll n = a.size();
  ll x = rng() % n, y = rng() % n;
  while(x == y){
    x = rng() % n;
    y = rng() % n;
  }
  x = a[x];
  y = a[y];
  vector < ll > X, mid, Y;
  for(auto u : a){
    if(u - x && u - y){
      ll z = Query(x, y, u);
      if(z == x) X.pb(u);
      if(z == y) Y.pb(u);
      if(z != x && z != y) mid.pb(u);
    }
  }
  shuffle(X.begin(), X.end(), rng);
  shuffle(Y.begin(), Y.end(), rng);

  // for x nodes
  vector < vector < ll > > F;
  for(auto u : X){
    bool ok = 0;
    for(ll i = 0; i < F.size(); i++){
      if(Query(u, F[i][0], x) != x){
        F[i].pb(u);
        ok = 1;
        break;
      }
    }
    if(!ok){
      F.pb({u});
    }
  }
  F.pb(mid);
  for(auto vec : F){
    if(vec.size() == 0) continue;
    solve(vec);
    for(auto u : vec) col[u] = 0;
    //cout << vec.size() << '\n';
    vector < ll > potential_cands;
    for(auto u : vec){
      potential_cands.pb(u);
    }
    shuffle(potential_cands.begin(), potential_cands.end(), rng);
    ll node = potential_cands[0]; 
    col[node] = 1;
    for(ll i = 0; i < potential_cands.size(); i++){
      if(col[potential_cands[i]]) continue;
      ll z = Query(potential_cands[i], node, x);
      if(z == node){
        dfs(potential_cands[i]);
      }else{
        col[node] = 0;
        col[z] = 1;
        dfs(potential_cands[i]);
        dfs(node);
        node = z;
      }
    }
    v[x].pb(node);
    v[node].pb(x);
    //cout << node << ' ' << x << " <- x" << '\n';
  }

  if(mid.size() == 0){
    v[x].pb(y);
    v[y].pb(x);
    //cout << y << ' ' << x << " <- m" << '\n';
  }

  F.clear();

  // for y nodes
  for(auto u : Y){
    bool ok = 0;
    for(ll i = 0; i < F.size(); i++){
      if(Query(u, F[i][0], y) != y){
        F[i].pb(u);
        ok = 1;
        break;
      }
    }
    if(!ok){
      F.pb({u});
    }
  }
  F.pb(mid);

  for(auto vec : F){
    if(vec.size() == 0) continue;
    if(vec != mid) solve(vec);
    for(auto u : vec) col[u] = 0;
    vector < ll > potential_cands;
    for(auto u : vec){
      potential_cands.pb(u);
    }
    shuffle(potential_cands.begin(), potential_cands.end(), rng);
    ll node = potential_cands[0]; 
    col[node] = 1;
    for(ll i = 0; i < potential_cands.size(); i++){
      if(col[potential_cands[i]]) continue;
      ll z = Query(potential_cands[i], node, y);
      if(z == node){
        dfs(potential_cands[i]);
      }else{
        col[node] = 0;
        col[z] = 1;
        dfs(potential_cands[i]);
        dfs(node);
        node = z;
      }
    }
    v[y].pb(node);
    v[node].pb(y);
    //cout << node << ' ' << y << " <- y" << '\n';
  }
  return;
}

void Solve(int n) {
  vector < ll > a;
  for(ll i = 0; i < n; i++) a.pb(i);
  solve(a);
  for(ll i = 0; i < n; i++){
    for(auto u : v[i]){
      if(u > i) Bridge(i, u);
    }
  }
  return;
}

Compilation message

meetings.cpp: In function 'void solve(std::vector<int>)':
meetings.cpp:60:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |     for(ll i = 0; i < F.size(); i++){
      |                   ~~^~~~~~~~~~
meetings.cpp:84:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for(ll i = 0; i < potential_cands.size(); i++){
      |                   ~~^~~~~~~~~~~~~~~~~~~~~~~~
meetings.cpp:113:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |     for(ll i = 0; i < F.size(); i++){
      |                   ~~^~~~~~~~~~
meetings.cpp:137:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  137 |     for(ll i = 0; i < potential_cands.size(); i++){
      |                   ~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 388 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 388 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 388 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 20 ms 496 KB Output is correct
28 Correct 16 ms 508 KB Output is correct
29 Correct 16 ms 512 KB Output is correct
30 Correct 16 ms 464 KB Output is correct
31 Correct 10 ms 496 KB Output is correct
32 Correct 18 ms 528 KB Output is correct
33 Correct 31 ms 592 KB Output is correct
34 Correct 18 ms 584 KB Output is correct
35 Correct 35 ms 596 KB Output is correct
36 Correct 10 ms 500 KB Output is correct
37 Correct 9 ms 464 KB Output is correct
38 Correct 8 ms 464 KB Output is correct
39 Correct 6 ms 408 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 1826 ms 2132 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -