oj.uz

Submission #1041100

# Submission time Handle Problem Language Result Execution time Memory
1041100 2024-08-01T15:36:22 Z edogawa_something Airline Route Map (JOI18_airline) C++17
37 / 100
 215 ms 19912 KB 
#include "Alicelib.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
bool mp[50][50];
vector<int> v[1500];
void Alice( int N, int M, int A[], int B[] ){
  if(N==1) {
    InitG(1,0);
    return;
  }
  if(N==2) {
    if(M==1)
      InitG(3,0);
    else
      InitG(2,0);
    return;
  }
  for(int i=0;i<M;i++)
    mp[A[i]][B[i]]=1,mp[B[i]][A[i]]=1;
  v[0].pb(2);
  v[1].pb(2);
  v[2].pb(3);
  for(int i=3;i<=3+(N*(N-1))/2;i++)
    v[i].pb(i+1);
  int cnt=0;
  for(int i=0;i<N;i++) {
    for(int j=i+1;j<N;j++) {
      if(mp[i][j])
        v[cnt+4].pb(2);
      cnt++;
    }
  }
  int ecnt=0;
  for(int i=0;i<1500;i++)
    ecnt+=v[i].size();
  cnt=0;
  InitG(5+(N*(N-1))/2,ecnt);
  for(int i=0;i<1500;i++) {
    for(auto it:v[i]) {
      MakeG(cnt++,i,it);
    }
  }
}


#include "Boblib.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int>adj[1500];
bool cnt[1500];
bool vis[1500];
vector<int>v1,vv;
void dfs(int x,int target) {
  if(vis[x])
    return;
  vis[x]=1;
  vv.pb(x);
  for(auto it:adj[x]) {
    if(vv.size()==2) {
      if(adj[it].size()==2)
        dfs(it,target);
      else
        continue;
    }
    if(!vis[it])
      dfs(it,target);
  }
  if(vv.size()>v1.size())
    v1=vv;
  vv.pop_back();
}
void Bob( int V, int U, int C[], int D[] ){
  if(U==0) {
    if(V==1) {
      InitMap(1,0);
    }
    else if(V==2) {
      InitMap(2,0);
    }
    else {
      InitMap(2,1);
      MakeMap(0,1);
    }
    return;
  }
  for(int i=0;i<U;i++) {
    adj[C[i]].pb(D[i]),adj[D[i]].pb(C[i]);
  }
  for(int i=0;i<V;i++) {
    if(adj[i].size()==1) {
      v1.pb(i);
    }
  }
  if(v1.size()==2) {
    int x=v1[0];
    v1.clear();
    dfs(x,V-1);
  }
  else if(v1.size()==3) {
    bool c=0;
    for(auto it:adj[v1[0]]) {
      for(auto itt:adj[it]) {
        if(itt==v1[1]||itt==v1[2])
          c=1;
      }
    }
    int x;
    if(c)
      x=v1[0],
      v1.clear(),
      dfs(x,V-1);
    else
      x=v1[1],v1.clear(),
      dfs(x,V-1);
  }
  for(int i=3;i<v1.size();i++) {
    for(auto it:adj[v1[i]]) {
      if(it==v1[1]) {
        cnt[i-3]=1;
      }
    }
  }
  int c=0;
  int n=V-4;
  int l=3,r=40,mid;
  while(l<=r) {
    mid=((l+r)>>1);
    if(mid*(mid-1)/2>=V-5)
      n=mid,r=mid-1;
    else
      l=mid+1;
  }
  vector<pair<int,int>>edge;
  for(int i=0;i<n;i++) {
    for(int j=i+1;j<n;j++) {
      if(cnt[c])
        edge.pb({i,j});
      c++;
    }
  }
  InitMap(n,edge.size());
  for(auto it:edge)
    MakeMap(it.first,it.second);
}

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:72:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |   for(int i=3;i<v1.size();i++) {
      |               ~^~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 15616 KB Output is correct
2 Correct 1 ms 15616 KB Output is correct
3 Correct 1 ms 15628 KB Output is correct
4 Correct 2 ms 13564 KB Output is correct
5 Correct 1 ms 15620 KB Output is correct
6 Correct 3 ms 15620 KB Output is correct
7 Correct 3 ms 15628 KB Output is correct
8 Correct 1 ms 15620 KB Output is correct
9 Correct 1 ms 15620 KB Output is correct
10 Correct 1 ms 13572 KB Output is correct
11 Correct 2 ms 15612 KB Output is correct
12 Correct 2 ms 15620 KB Output is correct
13 Correct 2 ms 15620 KB Output is correct
14 Correct 2 ms 15620 KB Output is correct
15 Correct 1 ms 15620 KB Output is correct
16 Correct 1 ms 15620 KB Output is correct
17 Correct 3 ms 15620 KB Output is correct
18 Correct 2 ms 15620 KB Output is correct
19 Correct 1 ms 15620 KB Output is correct
20 Correct 1 ms 15620 KB Output is correct
21 Correct 2 ms 15620 KB Output is correct
22 Correct 2 ms 15620 KB Output is correct
23 Correct 1 ms 15620 KB Output is correct
24 Correct 2 ms 13572 KB Output is correct
25 Correct 2 ms 15616 KB Output is correct
26 Correct 1 ms 15620 KB Output is correct
27 Correct 2 ms 15620 KB Output is correct
28 Correct 1 ms 15620 KB Output is correct
29 Correct 1 ms 15620 KB Output is correct
30 Correct 2 ms 13572 KB Output is correct
31 Correct 1 ms 13580 KB Output is correct
32 Correct 3 ms 13616 KB Output is correct
33 Correct 1 ms 13580 KB Output is correct
34 Correct 1 ms 13580 KB Output is correct
35 Correct 2 ms 13576 KB Output is correct
36 Correct 1 ms 15620 KB Output is correct
37 Correct 1 ms 15620 KB Output is correct
38 Correct 1 ms 15652 KB Output is correct
39 Correct 2 ms 15616 KB Output is correct
40 Correct 3 ms 15620 KB Output is correct
41 Correct 1 ms 15628 KB Output is correct
42 Correct 2 ms 15624 KB Output is correct
43 Correct 2 ms 15616 KB Output is correct
44 Correct 2 ms 13572 KB Output is correct
45 Correct 1 ms 13572 KB Output is correct
46 Correct 1 ms 15620 KB Output is correct
47 Correct 3 ms 15620 KB Output is correct
48 Correct 2 ms 15616 KB Output is correct
49 Correct 2 ms 15616 KB Output is correct
50 Correct 2 ms 13572 KB Output is correct
51 Correct 1 ms 9472 KB Output is correct
52 Correct 1 ms 11520 KB Output is correct
53 Correct 1 ms 9484 KB Output is correct
54 Correct 2 ms 15620 KB Output is correct
55 Correct 2 ms 15880 KB Output is correct
56 Correct 1 ms 15620 KB Output is correct
57 Correct 3 ms 15628 KB Output is correct
58 Correct 1 ms 15620 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 15616 KB Output is correct
2 Correct 1 ms 15616 KB Output is correct
3 Correct 1 ms 15628 KB Output is correct
4 Correct 2 ms 13564 KB Output is correct
5 Correct 1 ms 15620 KB Output is correct
6 Correct 3 ms 15620 KB Output is correct
7 Correct 3 ms 15628 KB Output is correct
8 Correct 1 ms 15620 KB Output is correct
9 Correct 1 ms 15620 KB Output is correct
10 Correct 1 ms 13572 KB Output is correct
11 Correct 2 ms 15612 KB Output is correct
12 Correct 2 ms 15620 KB Output is correct
13 Correct 2 ms 15620 KB Output is correct
14 Correct 2 ms 15620 KB Output is correct
15 Correct 1 ms 15620 KB Output is correct
16 Correct 1 ms 15620 KB Output is correct
17 Correct 3 ms 15620 KB Output is correct
18 Correct 2 ms 15620 KB Output is correct
19 Correct 1 ms 15620 KB Output is correct
20 Correct 1 ms 15620 KB Output is correct
21 Correct 2 ms 15620 KB Output is correct
22 Correct 2 ms 15620 KB Output is correct
23 Correct 1 ms 15620 KB Output is correct
24 Correct 2 ms 13572 KB Output is correct
25 Correct 2 ms 15616 KB Output is correct
26 Correct 1 ms 15620 KB Output is correct
27 Correct 2 ms 15620 KB Output is correct
28 Correct 1 ms 15620 KB Output is correct
29 Correct 1 ms 15620 KB Output is correct
30 Correct 2 ms 13572 KB Output is correct
31 Correct 1 ms 13580 KB Output is correct
32 Correct 3 ms 13616 KB Output is correct
33 Correct 1 ms 13580 KB Output is correct
34 Correct 1 ms 13580 KB Output is correct
35 Correct 2 ms 13576 KB Output is correct
36 Correct 1 ms 15620 KB Output is correct
37 Correct 1 ms 15620 KB Output is correct
38 Correct 1 ms 15652 KB Output is correct
39 Correct 2 ms 15616 KB Output is correct
40 Correct 3 ms 15620 KB Output is correct
41 Correct 1 ms 15628 KB Output is correct
42 Correct 2 ms 15624 KB Output is correct
43 Correct 2 ms 15616 KB Output is correct
44 Correct 2 ms 13572 KB Output is correct
45 Correct 1 ms 13572 KB Output is correct
46 Correct 1 ms 15620 KB Output is correct
47 Correct 3 ms 15620 KB Output is correct
48 Correct 2 ms 15616 KB Output is correct
49 Correct 2 ms 15616 KB Output is correct
50 Correct 2 ms 13572 KB Output is correct
51 Correct 1 ms 9472 KB Output is correct
52 Correct 1 ms 11520 KB Output is correct
53 Correct 1 ms 9484 KB Output is correct
54 Correct 2 ms 15620 KB Output is correct
55 Correct 2 ms 15880 KB Output is correct
56 Correct 1 ms 15620 KB Output is correct
57 Correct 3 ms 15628 KB Output is correct
58 Correct 1 ms 15620 KB Output is correct
59 Correct 2 ms 15620 KB Output is correct
60 Correct 3 ms 15616 KB Output is correct
61 Correct 3 ms 15620 KB Output is correct
62 Correct 2 ms 15620 KB Output is correct
63 Correct 2 ms 15620 KB Output is correct
64 Correct 3 ms 15616 KB Output is correct
65 Correct 3 ms 15620 KB Output is correct
66 Correct 2 ms 15620 KB Output is correct
67 Correct 3 ms 15620 KB Output is correct
68 Correct 2 ms 15628 KB Output is correct
69 Correct 2 ms 15628 KB Output is correct
70 Correct 3 ms 15680 KB Output is correct
71 Correct 2 ms 15624 KB Output is correct
72 Correct 3 ms 15616 KB Output is correct
73 Correct 2 ms 15620 KB Output is correct
74 Correct 2 ms 15620 KB Output is correct
75 Correct 2 ms 15620 KB Output is correct
76 Correct 2 ms 15632 KB Output is correct
77 Correct 2 ms 15692 KB Output is correct
78 Correct 2 ms 15620 KB Output is correct
79 Correct 2 ms 15620 KB Output is correct
80 Correct 2 ms 15624 KB Output is correct
81 Correct 2 ms 15620 KB Output is correct
82 Correct 2 ms 15620 KB Output is correct
83 Correct 2 ms 15620 KB Output is correct
84 Correct 2 ms 15628 KB Output is correct
85 Correct 2 ms 15628 KB Output is correct
86 Correct 2 ms 15620 KB Output is correct
87 Correct 2 ms 15620 KB Output is correct
88 Correct 1 ms 15620 KB Output is correct
89 Correct 2 ms 13568 KB Output is correct
90 Correct 2 ms 13572 KB Output is correct
91 Correct 2 ms 13572 KB Output is correct
92 Correct 2 ms 13572 KB Output is correct
93 Correct 2 ms 13568 KB Output is correct
94 Correct 2 ms 15616 KB Output is correct
95 Correct 2 ms 15620 KB Output is correct
96 Correct 2 ms 15620 KB Output is correct
97 Correct 3 ms 15612 KB Output is correct
98 Correct 2 ms 15644 KB Output is correct
99 Correct 3 ms 15632 KB Output is correct
100 Correct 2 ms 15620 KB Output is correct
101 Correct 3 ms 15620 KB Output is correct
102 Correct 2 ms 13568 KB Output is correct
103 Correct 2 ms 15620 KB Output is correct
104 Correct 2 ms 15620 KB Output is correct
105 Correct 2 ms 15868 KB Output is correct
106 Correct 2 ms 15620 KB Output is correct
107 Correct 2 ms 15620 KB Output is correct
108 Correct 3 ms 15620 KB Output is correct
109 Correct 2 ms 15620 KB Output is correct
110 Correct 2 ms 15620 KB Output is correct
111 Correct 2 ms 15620 KB Output is correct
112 Correct 1 ms 15620 KB Output is correct
113 Correct 2 ms 15620 KB Output is correct
114 Correct 1 ms 15620 KB Output is correct
115 Correct 2 ms 15620 KB Output is correct
116 Correct 1 ms 15620 KB Output is correct
117 Correct 2 ms 15616 KB Output is correct
118 Correct 2 ms 15620 KB Output is correct

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Runtime error 215 ms 19912 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -