oj.uz

Submission #917583

# Submission time Handle Problem Language Result Execution time Memory
917583 2024-01-28T12:35:37 Z alexdd Airline Route Map (JOI18_airline) C++17
37 / 100
 2500 ms 163644 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>> edges;
    for(int i=0;i<M;i++)
        edges.push_back({A[i],B[i]});
    for(int i=0;i<N;i++)
    {
        for(int b=0;b<10;b++)
        {
            if((i&(1<<b)))
            {
                edges.push_back({i,N+b});
            }
        }
    }
    for(int i=0;i<N+10;i++)
        edges.push_back({N+10,i});
    for(int i=0;i<10;i++)
        edges.push_back({N+11,N+i});
    for(int i=0;i<9;i++)
        edges.push_back({N+i,N+i+1});
    InitG(N+12, edges.size());
    for(int i=0;i<edges.size();i++)
        MakeG(i,edges[i].first,edges[i].second);
}


#include "Boblib.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> con[1100];
map<pair<int,int>,int> mp;
map<pair<int,int>,int> init;
int p,q;
int sum[1100];
void Bob(int V, int U, int C[], int D[])
{
    for(int i=0;i<U;i++)
    {
        con[C[i]].push_back(D[i]);
        con[D[i]].push_back(C[i]);
        mp[{C[i],D[i]}]++;
        mp[{D[i],C[i]}]++;
    }
    for(int i=0;i<V;i++)
    {
        if((int)con[i].size() == V-2)
        {
            p=i;
            for(int j=0;j<V;j++)
                if(j!=i && mp[{i,j}]==0)
                    q=j;
            break;
        }
    }
    vector<int> b(10);
    b[0]=-1;
    for(auto x:con[q])
    {
        int aux=0;
        for(auto y:con[q])
            if(mp[{x,y}])
                aux++;
        if(aux==1 && b[0]==-1)
            b[0]=x;
        else if(aux==1)
            b[9]=x;
    }
    if((int)con[b[0]].size() < (int)con[b[9]].size())
        swap(b[0],b[9]);
    for(int i=1;i<9;i++)
    {
        for(auto x:con[q])
        {
            if((i==1 || x!=b[i-2]) && mp[{x,b[i-1]}])
            {
                b[i]=x;
                break;
            }
        }
    }
    for(int i=0;i<10;i++)
        for(auto x:con[b[i]])
            sum[x] += (1<<i);
    vector<pair<int,int>> rez;
    for(int i=0;i<V;i++)
    {
        if(i!=p && i!=q && !mp[{q,i}])
        {
            //cout<<i<<" "<<sum[i]<<" sum\n";
            for(auto x:con[i])
            {
                if(x!=p && x!=q && !mp[{q,x}] && init[{sum[x],sum[i]}]==0)
                {
                    init[{sum[i],sum[x]}]++;
                    rez.push_back({sum[i],sum[x]});
                }
            }
        }
    }
    InitMap(V-12,rez.size());
    for(auto e:rez)
        MakeMap(e.first,e.second);

}

Compilation message

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

Subtask #1
22.0 / 22.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2875 ms 163644 KB Time limit exceeded
2 Halted 0 ms 0 KB -