oj.uz

Submission #925219

# Submission time Handle Problem Language Result Execution time Memory
925219 2024-02-11T05:14:12 Z huutuan Airline Route Map (JOI18_airline) C++14
0 / 100
 438 ms 37852 KB 
#include "Alicelib.h"

#include <bits/stdc++.h>

using namespace std;

void Alice(int n, int m, int a[], int b[]){
   vector<pair<int, int>> ans;
   for (int i=0; i<m; ++i){
      ans.emplace_back(a[i], b[i]);
   }
   for (int i=0; i<n+10; ++i) if (i!=n) ans.emplace_back(i, n+10);
   for (int i=0; i<n; ++i){
      ans.emplace_back(i, n+11);
      for (int j=0; j<10; ++j) if (i>>j&1) ans.emplace_back(i, n+j);
   }
   for (int j=1; j<10; ++j){
      ans.emplace_back(n+j-1, n+j);
   }
   InitG(n+12, ans.size());
   for (int i=0; i<(int)ans.size(); ++i) MakeG(i, ans[i].first, ans[i].second);
}

#include "Boblib.h"

#include <bits/stdc++.h>

using namespace std;

const int N=2000;
bool adj[N][N];
int deg[N], id[20], isfake[N];
vector<int> g[N];
int code[N];

void Bob(int v, int u, int c[], int d[]){
   for (int i=0; i<u; ++i) ++deg[c[i]], ++deg[d[i]], adj[c[i]][d[i]]=adj[d[i]][c[i]]=1;
   id[10]=max_element(deg, deg+v)-deg;
   isfake[id[10]]=1;
   vector<int> idx;
   for (int i=0; i<v; ++i) if (i!=id[10] && !adj[id[10]][i]) idx.push_back(i);
   if (deg[idx[0]]<deg[idx[1]]) swap(idx[0], idx[1]);
   id[11]=idx[0];
   id[0]=idx[1];
   isfake[id[11]]=1;
   isfake[id[0]]=1;
   vector<int> bit{id[0]};
   for (int i=0; i<v; ++i) if (!adj[i][id[11]] && i!=id[10] && i!=id[11]){
      isfake[i]=1;
      bit.push_back(i);
   }
   vector<int> realbit;
   realbit.push_back(id[0]);
   for (int i=0; i<9; ++i) for (int j:bit){
      if (find(realbit.begin(), realbit.end(), j)==realbit.end() && adj[realbit.back()][j]){
         realbit.push_back(j);
         break;
      }
   }
   for (int i=0; i<v; ++i) if (!isfake[i]){
      for (int j=0; j<10; ++j) code[i]|=(adj[i][realbit[j]])<<j;
   }
   vector<pair<int, int>> ans;
   for (int i=0; i<u; ++i){
      if (!isfake[c[i]] && !isfake[d[i]]){
         ans.emplace_back(code[c[i]], code[d[i]]);
      }
   }
   InitMap(v-12, ans.size());
   for (auto &i:ans) MakeMap(i.first, i.second);
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17668 KB Output is correct
2 Correct 2 ms 17668 KB Output is correct
3 Correct 3 ms 17668 KB Output is correct
4 Correct 2 ms 15620 KB Output is correct
5 Correct 3 ms 17664 KB Output is correct
6 Correct 3 ms 17668 KB Output is correct
7 Correct 3 ms 17668 KB Output is correct
8 Correct 3 ms 17660 KB Output is correct
9 Correct 2 ms 17916 KB Output is correct
10 Correct 2 ms 15616 KB Output is correct
11 Correct 2 ms 17656 KB Output is correct
12 Correct 3 ms 17664 KB Output is correct
13 Correct 2 ms 17668 KB Output is correct
14 Correct 3 ms 17668 KB Output is correct
15 Correct 3 ms 17668 KB Output is correct
16 Correct 2 ms 17668 KB Output is correct
17 Correct 3 ms 17664 KB Output is correct
18 Correct 2 ms 17668 KB Output is correct
19 Correct 2 ms 17668 KB Output is correct
20 Correct 3 ms 17664 KB Output is correct
21 Correct 3 ms 17668 KB Output is correct
22 Correct 2 ms 17668 KB Output is correct
23 Correct 3 ms 17668 KB Output is correct
24 Correct 2 ms 15620 KB Output is correct
25 Correct 3 ms 17668 KB Output is correct
26 Correct 2 ms 17668 KB Output is correct
27 Correct 2 ms 17664 KB Output is correct
28 Correct 2 ms 17668 KB Output is correct
29 Correct 2 ms 17920 KB Output is correct
30 Correct 2 ms 15620 KB Output is correct
31 Correct 3 ms 15620 KB Output is correct
32 Correct 2 ms 15620 KB Output is correct
33 Correct 2 ms 15592 KB Output is correct
34 Correct 2 ms 15620 KB Output is correct
35 Correct 2 ms 15616 KB Output is correct
36 Correct 3 ms 17664 KB Output is correct
37 Correct 2 ms 17668 KB Output is correct
38 Correct 3 ms 17672 KB Output is correct
39 Correct 3 ms 17664 KB Output is correct
40 Correct 2 ms 17668 KB Output is correct
41 Correct 2 ms 17664 KB Output is correct
42 Correct 3 ms 17668 KB Output is correct
43 Correct 3 ms 17664 KB Output is correct
44 Correct 2 ms 15616 KB Output is correct
45 Correct 2 ms 15620 KB Output is correct
46 Correct 2 ms 17672 KB Output is correct
47 Correct 3 ms 17668 KB Output is correct
48 Correct 2 ms 17668 KB Output is correct
49 Correct 2 ms 17888 KB Output is correct
50 Correct 2 ms 15620 KB Output is correct
51 Correct 2 ms 15620 KB Output is correct
52 Incorrect 3 ms 17668 KB Wrong Answer [11]
53 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17668 KB Output is correct
2 Correct 2 ms 17668 KB Output is correct
3 Correct 3 ms 17668 KB Output is correct
4 Correct 2 ms 15620 KB Output is correct
5 Correct 3 ms 17664 KB Output is correct
6 Correct 3 ms 17668 KB Output is correct
7 Correct 3 ms 17668 KB Output is correct
8 Correct 3 ms 17660 KB Output is correct
9 Correct 2 ms 17916 KB Output is correct
10 Correct 2 ms 15616 KB Output is correct
11 Correct 2 ms 17656 KB Output is correct
12 Correct 3 ms 17664 KB Output is correct
13 Correct 2 ms 17668 KB Output is correct
14 Correct 3 ms 17668 KB Output is correct
15 Correct 3 ms 17668 KB Output is correct
16 Correct 2 ms 17668 KB Output is correct
17 Correct 3 ms 17664 KB Output is correct
18 Correct 2 ms 17668 KB Output is correct
19 Correct 2 ms 17668 KB Output is correct
20 Correct 3 ms 17664 KB Output is correct
21 Correct 3 ms 17668 KB Output is correct
22 Correct 2 ms 17668 KB Output is correct
23 Correct 3 ms 17668 KB Output is correct
24 Correct 2 ms 15620 KB Output is correct
25 Correct 3 ms 17668 KB Output is correct
26 Correct 2 ms 17668 KB Output is correct
27 Correct 2 ms 17664 KB Output is correct
28 Correct 2 ms 17668 KB Output is correct
29 Correct 2 ms 17920 KB Output is correct
30 Correct 2 ms 15620 KB Output is correct
31 Correct 3 ms 15620 KB Output is correct
32 Correct 2 ms 15620 KB Output is correct
33 Correct 2 ms 15592 KB Output is correct
34 Correct 2 ms 15620 KB Output is correct
35 Correct 2 ms 15616 KB Output is correct
36 Correct 3 ms 17664 KB Output is correct
37 Correct 2 ms 17668 KB Output is correct
38 Correct 3 ms 17672 KB Output is correct
39 Correct 3 ms 17664 KB Output is correct
40 Correct 2 ms 17668 KB Output is correct
41 Correct 2 ms 17664 KB Output is correct
42 Correct 3 ms 17668 KB Output is correct
43 Correct 3 ms 17664 KB Output is correct
44 Correct 2 ms 15616 KB Output is correct
45 Correct 2 ms 15620 KB Output is correct
46 Correct 2 ms 17672 KB Output is correct
47 Correct 3 ms 17668 KB Output is correct
48 Correct 2 ms 17668 KB Output is correct
49 Correct 2 ms 17888 KB Output is correct
50 Correct 2 ms 15620 KB Output is correct
51 Correct 2 ms 15620 KB Output is correct
52 Incorrect 3 ms 17668 KB Wrong Answer [11]
53 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Incorrect 438 ms 37852 KB Wrong Answer [11]
2 Halted 0 ms 0 KB -