oj.uz

Submission #44162

# Submission time Handle Problem Language Result Execution time Memory
44162 2018-03-30T09:06:21 Z zscoder Airline Route Map (JOI18_airline) C++17
37 / 100
 1821 ms 120716 KB 
#include "Alicelib.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
 
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<ll>::iterator sit;
typedef map<ll,ll>::iterator mit;

void Alice( int N, int M, int A[], int B[] )
{
	vector<ii> edges;
	for(int i=0;i<M;i++)
	{
		edges.pb(mp(A[i],B[i]));
	}
	for(int i=0;i<10;i++)
	{
		for(int j=0;j<N;j++)
		{
			if(j&(1<<i))
			{
				edges.pb(mp(N+i, j));
			}
		}
	}
	for(int j=0;j<9;j++)
	{
		edges.pb(mp(N+j, N+j+1));
	}
	for(int i=0;i<2;i++)
	{
		for(int j=0;j<10;j++)
		{
			edges.pb(mp(N+10+i, N+j));
		}
	}
	InitG(N+12, int(edges.size()));
	//cerr<<N+12<<' '<<edges.size()<<'\n';
	for(int i=0;i<edges.size();i++)
	{
		//cerr<<i<<' '<<edges[i].fi<<' '<<edges[i].se<<'\n';
		MakeG(i, edges[i].fi, edges[i].se);
	}
}


#include "Boblib.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
 
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<ll>::iterator sit;
typedef map<ll,ll>::iterator mit;

static int perm[1111];
static set<int> adj[1111];
static ll hsh[1111];
static bool vis[1111];

void Bob( int V, int U, int C[], int D[] )
{
	for(int i=0;i<U;i++)
	{
		adj[C[i]].insert(D[i]); adj[D[i]].insert(C[i]);
	}
	const int cc = 2017;
	for(int i=0;i<U;i++)
	{
		for(int v:adj[i])
		{
			hsh[i]*=cc;
			hsh[i]+=v+1;
		}
	}
	int idx=0; int idy=0;
	for(int i=0;i<V;i++)
	{
		for(int j=i+1;j<V;j++)
		{
			if(adj[i].size()==10&&adj[j].size()==10&&hsh[i]==hsh[j])
			{
				idx=i; idy=j; break;
			}
		}
	}
	int bitgod[10]={};
	set<int> gods;
	for(int v:adj[idx]) gods.insert(v);
	vi pathend;
	for(int v:adj[idx])
	{
		int cnt=0;
		for(int x:gods)
		{
			cnt+=(adj[v].find(x)!=adj[v].end());
		}
		if(cnt==1) pathend.pb(v);
	}
	assert(pathend.size()==2);
	if(adj[pathend[0]].size()<adj[pathend[1]].size()) swap(pathend[0],pathend[1]);
	bitgod[0] = pathend[0];
	vis[bitgod[0]] = 1;
	for(int i=1;i<10;i++)
	{
		int cur = bitgod[i-1];
		for(int v:adj[cur])
		{
			if(gods.find(v)!=gods.end()&&!vis[v])
			{
				bitgod[i] = v; vis[v] = 1; break;
			}
		}
	}
	memset(perm,-1,sizeof(perm));
	for(int i=0;i<V;i++)
	{
		if(gods.find(i)==gods.end()&&i!=idx&&i!=idy)
		{
			int label=0;
			for(int j=0;j<10;j++)
			{
				if(adj[i].find(bitgod[j])!=adj[i].end())
				{
					label^=(1<<j);
				}
			}
			perm[i] = label;
		}
	}
	vector<ii> edges;
	for(int i=0;i<U;i++)
	{
		if(perm[C[i]]!=-1&&perm[D[i]]!=-1) edges.pb(mp(perm[C[i]],perm[D[i]]));
	}
	InitMap(V - 12, int(edges.size()));
	for(int i=0;i<edges.size();i++)
	{
		MakeMap(edges[i].fi, edges[i].se);
	}
}

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:56:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<edges.size();i++)
              ~^~~~~~~~~~~~~

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:107:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<edges.size();i++)
              ~^~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6896 KB Output is correct
2 Correct 8 ms 6904 KB Output is correct
3 Correct 7 ms 6896 KB Output is correct
4 Correct 7 ms 6896 KB Output is correct
5 Correct 7 ms 6736 KB Output is correct
6 Correct 6 ms 6640 KB Output is correct
7 Correct 7 ms 6640 KB Output is correct
8 Correct 7 ms 6896 KB Output is correct
9 Correct 8 ms 6896 KB Output is correct
10 Correct 7 ms 6640 KB Output is correct
11 Correct 7 ms 6640 KB Output is correct
12 Correct 7 ms 6736 KB Output is correct
13 Correct 6 ms 6576 KB Output is correct
14 Correct 7 ms 6736 KB Output is correct
15 Correct 6 ms 6904 KB Output is correct
16 Correct 8 ms 6896 KB Output is correct
17 Correct 8 ms 6736 KB Output is correct
18 Correct 8 ms 6640 KB Output is correct
19 Correct 6 ms 6640 KB Output is correct
20 Correct 6 ms 6736 KB Output is correct
21 Correct 6 ms 6640 KB Output is correct
22 Correct 8 ms 6896 KB Output is correct
23 Correct 7 ms 6640 KB Output is correct
24 Correct 7 ms 6640 KB Output is correct
25 Correct 8 ms 6896 KB Output is correct
26 Correct 7 ms 6640 KB Output is correct
27 Correct 8 ms 6944 KB Output is correct
28 Correct 8 ms 6736 KB Output is correct
29 Correct 7 ms 6640 KB Output is correct
30 Correct 8 ms 6896 KB Output is correct
31 Correct 8 ms 6896 KB Output is correct
32 Correct 8 ms 6896 KB Output is correct
33 Correct 8 ms 6952 KB Output is correct
34 Correct 8 ms 6640 KB Output is correct
35 Correct 8 ms 6664 KB Output is correct
36 Correct 6 ms 6640 KB Output is correct
37 Correct 7 ms 6640 KB Output is correct
38 Correct 8 ms 6600 KB Output is correct
39 Correct 8 ms 6736 KB Output is correct
40 Correct 8 ms 6736 KB Output is correct
41 Correct 8 ms 6896 KB Output is correct
42 Correct 7 ms 6640 KB Output is correct
43 Correct 7 ms 6752 KB Output is correct
44 Correct 8 ms 6640 KB Output is correct
45 Correct 8 ms 6656 KB Output is correct
46 Correct 8 ms 6896 KB Output is correct
47 Correct 8 ms 6736 KB Output is correct
48 Correct 7 ms 6640 KB Output is correct
49 Correct 7 ms 6896 KB Output is correct
50 Correct 7 ms 6640 KB Output is correct
51 Correct 7 ms 6640 KB Output is correct
52 Correct 8 ms 6640 KB Output is correct
53 Correct 8 ms 6736 KB Output is correct
54 Correct 8 ms 6640 KB Output is correct
55 Correct 8 ms 6896 KB Output is correct
56 Correct 8 ms 6904 KB Output is correct
57 Correct 8 ms 6896 KB Output is correct
58 Correct 8 ms 6640 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6896 KB Output is correct
2 Correct 8 ms 6904 KB Output is correct
3 Correct 7 ms 6896 KB Output is correct
4 Correct 7 ms 6896 KB Output is correct
5 Correct 7 ms 6736 KB Output is correct
6 Correct 6 ms 6640 KB Output is correct
7 Correct 7 ms 6640 KB Output is correct
8 Correct 7 ms 6896 KB Output is correct
9 Correct 8 ms 6896 KB Output is correct
10 Correct 7 ms 6640 KB Output is correct
11 Correct 7 ms 6640 KB Output is correct
12 Correct 7 ms 6736 KB Output is correct
13 Correct 6 ms 6576 KB Output is correct
14 Correct 7 ms 6736 KB Output is correct
15 Correct 6 ms 6904 KB Output is correct
16 Correct 8 ms 6896 KB Output is correct
17 Correct 8 ms 6736 KB Output is correct
18 Correct 8 ms 6640 KB Output is correct
19 Correct 6 ms 6640 KB Output is correct
20 Correct 6 ms 6736 KB Output is correct
21 Correct 6 ms 6640 KB Output is correct
22 Correct 8 ms 6896 KB Output is correct
23 Correct 7 ms 6640 KB Output is correct
24 Correct 7 ms 6640 KB Output is correct
25 Correct 8 ms 6896 KB Output is correct
26 Correct 7 ms 6640 KB Output is correct
27 Correct 8 ms 6944 KB Output is correct
28 Correct 8 ms 6736 KB Output is correct
29 Correct 7 ms 6640 KB Output is correct
30 Correct 8 ms 6896 KB Output is correct
31 Correct 8 ms 6896 KB Output is correct
32 Correct 8 ms 6896 KB Output is correct
33 Correct 8 ms 6952 KB Output is correct
34 Correct 8 ms 6640 KB Output is correct
35 Correct 8 ms 6664 KB Output is correct
36 Correct 6 ms 6640 KB Output is correct
37 Correct 7 ms 6640 KB Output is correct
38 Correct 8 ms 6600 KB Output is correct
39 Correct 8 ms 6736 KB Output is correct
40 Correct 8 ms 6736 KB Output is correct
41 Correct 8 ms 6896 KB Output is correct
42 Correct 7 ms 6640 KB Output is correct
43 Correct 7 ms 6752 KB Output is correct
44 Correct 8 ms 6640 KB Output is correct
45 Correct 8 ms 6656 KB Output is correct
46 Correct 8 ms 6896 KB Output is correct
47 Correct 8 ms 6736 KB Output is correct
48 Correct 7 ms 6640 KB Output is correct
49 Correct 7 ms 6896 KB Output is correct
50 Correct 7 ms 6640 KB Output is correct
51 Correct 7 ms 6640 KB Output is correct
52 Correct 8 ms 6640 KB Output is correct
53 Correct 8 ms 6736 KB Output is correct
54 Correct 8 ms 6640 KB Output is correct
55 Correct 8 ms 6896 KB Output is correct
56 Correct 8 ms 6904 KB Output is correct
57 Correct 8 ms 6896 KB Output is correct
58 Correct 8 ms 6640 KB Output is correct
59 Correct 8 ms 6640 KB Output is correct
60 Correct 8 ms 6640 KB Output is correct
61 Correct 7 ms 6640 KB Output is correct
62 Correct 7 ms 6896 KB Output is correct
63 Correct 7 ms 6896 KB Output is correct
64 Correct 8 ms 6640 KB Output is correct
65 Correct 8 ms 6640 KB Output is correct
66 Correct 8 ms 6640 KB Output is correct
67 Correct 8 ms 6736 KB Output is correct
68 Correct 8 ms 6640 KB Output is correct
69 Correct 7 ms 6896 KB Output is correct
70 Correct 8 ms 6640 KB Output is correct
71 Correct 8 ms 6696 KB Output is correct
72 Correct 9 ms 7024 KB Output is correct
73 Correct 8 ms 6864 KB Output is correct
74 Correct 8 ms 6736 KB Output is correct
75 Correct 8 ms 6648 KB Output is correct
76 Correct 8 ms 6808 KB Output is correct
77 Correct 8 ms 6744 KB Output is correct
78 Correct 8 ms 6896 KB Output is correct
79 Correct 8 ms 6896 KB Output is correct
80 Correct 8 ms 6640 KB Output is correct
81 Correct 8 ms 6640 KB Output is correct
82 Correct 8 ms 6640 KB Output is correct
83 Correct 8 ms 6648 KB Output is correct
84 Correct 8 ms 6640 KB Output is correct
85 Correct 8 ms 6648 KB Output is correct
86 Correct 8 ms 6640 KB Output is correct
87 Correct 8 ms 6896 KB Output is correct
88 Correct 8 ms 6640 KB Output is correct
89 Correct 8 ms 6640 KB Output is correct
90 Correct 8 ms 6640 KB Output is correct
91 Correct 6 ms 6640 KB Output is correct
92 Correct 6 ms 6640 KB Output is correct
93 Correct 8 ms 6952 KB Output is correct
94 Correct 8 ms 6640 KB Output is correct
95 Correct 8 ms 6640 KB Output is correct
96 Correct 8 ms 6736 KB Output is correct
97 Correct 8 ms 6728 KB Output is correct
98 Correct 8 ms 6640 KB Output is correct
99 Correct 7 ms 6592 KB Output is correct
100 Correct 8 ms 6640 KB Output is correct
101 Correct 7 ms 6640 KB Output is correct
102 Correct 6 ms 6640 KB Output is correct
103 Correct 8 ms 6640 KB Output is correct
104 Correct 8 ms 6640 KB Output is correct
105 Correct 8 ms 6640 KB Output is correct
106 Correct 6 ms 6640 KB Output is correct
107 Correct 8 ms 6704 KB Output is correct
108 Correct 7 ms 6736 KB Output is correct
109 Correct 8 ms 6736 KB Output is correct
110 Correct 7 ms 6896 KB Output is correct
111 Correct 8 ms 6640 KB Output is correct
112 Correct 8 ms 6736 KB Output is correct
113 Correct 6 ms 6640 KB Output is correct
114 Correct 17 ms 6640 KB Output is correct
115 Correct 8 ms 6896 KB Output is correct
116 Correct 8 ms 6736 KB Output is correct
117 Correct 8 ms 6896 KB Output is correct
118 Correct 8 ms 6896 KB Output is correct

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Runtime error 1821 ms 120716 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -