oj.uz

Submission #702618

# Submission time Handle Problem Language Result Execution time Memory
702618 2023-02-24T15:15:09 Z victor_gao Meetings (JOI19_meetings) C++17
100 / 100
 571 ms 1004 KB 
#include<bits/stdc++.h>
#include "meetings.h"
#define pii pair<int,int>
#define x first
#define y second
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int>Merge_sort(vector<int>now,int mn){
  if (now.size()==1) return now;
  int n=now.size(),mid=(n-1)/2;
  vector<int>l,r,ans;
  for (int i=0;i<=mid;i++)
    l.push_back(now[i]);
  for (int i=mid+1;i<n;i++)
    r.push_back(now[i]);
  l=Merge_sort(l,mn);
  r=Merge_sort(r,mn);
  int p=0;
  for (auto i:l){
    if (p>=r.size()){
      ans.push_back(i);
      continue;
    }
    int small=Query(mn,i,r[p]);
    while(p<r.size()&&small==r[p]){
      ans.push_back(r[p++]);
      if (p<r.size())
        small=Query(mn,i,r[p]);
    }
    ans.push_back(i);
  }
  while (p<r.size())
    ans.push_back(r[p++]);
  return ans;
}
set<pii>ans;
void DC(vector<int>have,int dep){
 // cout<<dep<<" "<<have.size()<<'\n';
  int n=have.size();
  if (n==1) return;
  else if (n==2){
  //  cout<<"n=2 add : "<<min(have[0],have[1])<<" "<<max(have[0],have[1])<<'\n';
    assert(have[0]!=have[1]);
    ans.insert({min(have[0],have[1]),max(have[0],have[1])});
    return;
  }
  shuffle(have.begin(),have.end(),rng);
  int p1=have[0],p2=have[1];
  vector<vector<int> >all(n);
  vector<int>path;
  map<int,int>mp;
  /*
  cout<<"solve : ";
  for (auto i:have)
    cout<<i<<" ";
  cout<<'\n';
  cout<<"root is "<<p1<<" "<<p2<<'\n';
 */
  path.push_back(p2);
  all[0].push_back(p1);
  all[1].push_back(p2);
  for (int id=2;id<n;id++){
    int i=have[id];
    int nxt=Query(p1,i,p2);
    if (nxt==i)
      path.push_back(i);
    if (nxt!=p1&&nxt!=p2){
      if (!mp[nxt]) mp[nxt]=id;
      all[mp[nxt]].push_back(i);
    }
    else if (nxt==p1)
      all[0].push_back(i);
    else all[1].push_back(i);
  }
  /*
  for (int i=0;i<n;i++){
    if (!all[i].empty()){
      cout<<"son "<<i<<" : ";
      for (auto j:all[i])
        cout<<j<<" ";
      cout<<'\n';
    }
  }
  cout<<"path : "<<p1<<' ';
  for (auto i:path)
    cout<<i<<" ";
  cout<<'\n';
  */
  path=Merge_sort(path,p1);
//  cout<<"add "<<min(p1,path[0])<<' '<<max(p1,path[0])<<'\n';
  assert(p1!=path[0]);
  ans.insert({min(p1,path[0]),max(p1,path[0])});
  for (int i=1;i<path.size();i++){
  //  cout<<"add "<<min(path[i],path[i-1])<<" "<<max(path[i],path[i-1])<<'\n';
    assert(path[i]!=path[i-1]);
    ans.insert({min(path[i],path[i-1]),max(path[i],path[i-1])});
  }
  for (int i=0;i<n;i++){
    if (!all[i].empty()){
      DC(all[i],dep+1);
    }
  }
}

void Solve(int N){
  vector<int>dq;
  for (int i=0;i<N;i++)
    dq.push_back(i);
  DC(dq,0);
  for (auto i:ans){
   // assert(i.x!=i.y);
   // assert(i.x<i.y);
  //  cout<<i.x<<" "<<i.y<<'\n';
    Bridge(i.x,i.y);
  }
}

Compilation message

meetings.cpp: In function 'std::vector<int> Merge_sort(std::vector<int>, int)':
meetings.cpp:21:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     if (p>=r.size()){
      |         ~^~~~~~~~~~
meetings.cpp:26:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     while(p<r.size()&&small==r[p]){
      |           ~^~~~~~~~~
meetings.cpp:28:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |       if (p<r.size())
      |           ~^~~~~~~~~
meetings.cpp:33:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |   while (p<r.size())
      |          ~^~~~~~~~~
meetings.cpp: In function 'void DC(std::vector<int>, int)':
meetings.cpp:94:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |   for (int i=1;i<path.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 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 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 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 0 ms 336 KB Output is correct
25 Correct 1 ms 356 KB Output is correct
26 Correct 0 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 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 0 ms 336 KB Output is correct
25 Correct 1 ms 356 KB Output is correct
26 Correct 0 ms 336 KB Output is correct
27 Correct 5 ms 336 KB Output is correct
28 Correct 4 ms 336 KB Output is correct
29 Correct 4 ms 336 KB Output is correct
30 Correct 4 ms 336 KB Output is correct
31 Correct 4 ms 408 KB Output is correct
32 Correct 8 ms 336 KB Output is correct
33 Correct 7 ms 384 KB Output is correct
34 Correct 9 ms 440 KB Output is correct
35 Correct 8 ms 336 KB Output is correct
36 Correct 4 ms 336 KB Output is correct
37 Correct 9 ms 424 KB Output is correct
38 Correct 6 ms 336 KB Output is correct
39 Correct 9 ms 420 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 800 KB Output is correct
2 Correct 364 ms 712 KB Output is correct
3 Correct 357 ms 696 KB Output is correct
4 Correct 288 ms 712 KB Output is correct
5 Correct 202 ms 704 KB Output is correct
6 Correct 241 ms 692 KB Output is correct
7 Correct 364 ms 724 KB Output is correct
8 Correct 363 ms 876 KB Output is correct
9 Correct 348 ms 688 KB Output is correct
10 Correct 322 ms 764 KB Output is correct
11 Correct 359 ms 720 KB Output is correct
12 Correct 235 ms 760 KB Output is correct
13 Correct 208 ms 732 KB Output is correct
14 Correct 290 ms 716 KB Output is correct
15 Correct 326 ms 768 KB Output is correct
16 Correct 341 ms 724 KB Output is correct
17 Correct 322 ms 872 KB Output is correct
18 Correct 267 ms 720 KB Output is correct
19 Correct 207 ms 688 KB Output is correct
20 Correct 371 ms 848 KB Output is correct
21 Correct 352 ms 860 KB Output is correct
22 Correct 328 ms 728 KB Output is correct
23 Correct 376 ms 720 KB Output is correct
24 Correct 353 ms 708 KB Output is correct
25 Correct 305 ms 696 KB Output is correct
26 Correct 256 ms 640 KB Output is correct
27 Correct 297 ms 688 KB Output is correct
28 Correct 413 ms 1004 KB Output is correct
29 Correct 331 ms 816 KB Output is correct
30 Correct 345 ms 972 KB Output is correct
31 Correct 365 ms 876 KB Output is correct
32 Correct 571 ms 900 KB Output is correct
33 Correct 415 ms 948 KB Output is correct
34 Correct 4 ms 336 KB Output is correct
35 Correct 3 ms 336 KB Output is correct
36 Correct 5 ms 336 KB Output is correct
37 Correct 3 ms 336 KB Output is correct
38 Correct 3 ms 336 KB Output is correct
39 Correct 4 ms 336 KB Output is correct
40 Correct 7 ms 336 KB Output is correct
41 Correct 8 ms 348 KB Output is correct
42 Correct 7 ms 336 KB Output is correct
43 Correct 4 ms 336 KB Output is correct
44 Correct 5 ms 336 KB Output is correct
45 Correct 6 ms 432 KB Output is correct
46 Correct 9 ms 336 KB Output is correct
47 Correct 0 ms 336 KB Output is correct
48 Correct 0 ms 336 KB Output is correct
49 Correct 0 ms 336 KB Output is correct
50 Correct 0 ms 336 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 0 ms 336 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 0 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 0 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 1 ms 448 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 0 ms 336 KB Output is correct
63 Correct 1 ms 336 KB Output is correct
64 Correct 0 ms 336 KB Output is correct
65 Correct 0 ms 336 KB Output is correct
66 Correct 0 ms 336 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 0 ms 336 KB Output is correct
69 Correct 0 ms 336 KB Output is correct
70 Correct 0 ms 336 KB Output is correct
71 Correct 1 ms 336 KB Output is correct
72 Correct 1 ms 336 KB Output is correct