oj.uz

Submission #111730

# Submission time Handle Problem Language Result Execution time Memory
111730 2019-05-16T04:26:48 Z zscoder Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 1158 ms 217868 KB 
#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;
 
const int C = 200;
 
vi adj[111111];
vi radj[111111];
vector<ii> dp[111111];
int n,m,q; 
bool isbad[111111];
 
void solve_large(int u, vi &vec)
{
	int ans = -1;
	vi innerdp(n+1,-1);
	innerdp[u] = 0;
	for(int i=u;i>=0;i--)
	{
		for(int v:adj[i])
		{
			if(innerdp[v]!=-1) innerdp[i] = max(innerdp[i], innerdp[v] + 1);
		}
		if(!isbad[i]) ans = max(ans, innerdp[i]);
	}
	cout<<ans<<'\n';
}
 
vector<ii> mergevector(vector<ii> &v1, vector<ii> &v2)
{
	vector<ii> V;
	int p1 = 0; int p2 = 0;
	while((p1<v1.size()||p2<v2.size())&&V.size()<C+3)
	{
		int val1 = -100000; int val2 = -100000;
		if(p1<v1.size()) val1 = v1[p1].fi;
		if(p2<v2.size()) val2 = v2[p2].fi+1;
		if(val1>val2)
		{
			V.pb(mp(val1, v1[p1].se));
			p1++;
		}
		else
		{
			V.pb(mp(val2, v2[p2].se));
			p2++;
		}
	}
	return V;
}
 
int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin>>n>>m>>q;
	for(int i=0;i<m;i++)
	{
		int u, v; cin>>u>>v;u--;v--;
		adj[u].pb(v); radj[v].pb(u);
	}
	for(int i=0;i<n;i++)
	{
		dp[i].pb(mp(0,i));
		for(int v:radj[i])
		{
			dp[i] = mergevector(dp[i], dp[v]);
		}
		/*
		cerr<<"DP "<<i<<'\n';
		for(ii x:dp[i])
		{
			cerr<<x.fi<<' '<<x.se<<'\n';
		}
		*/
	}
	for(int i=0;i<q;i++)
	{
		int u; cin>>u; u--;
		int k; cin>>k; vi vec;
		for(int j=0;j<k;j++)
		{
			int v; cin>>v; v--; vec.pb(v);
		}
		for(int v:vec) isbad[v]=1;
		if(k>=C-1)
		{
			solve_large(u, vec);
		}
		else
		{
			int ans = -1;
			for(ii x:dp[u])
			{
				if(isbad[x.se]) continue;
				ans = max(ans, x.fi);
			}
			cout<<ans<<'\n';
		}
		for(int v:vec) isbad[v]=0;
	}
}

Compilation message

bitaro.cpp: In function 'std::vector<std::pair<int, int> > mergevector(std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)':
bitaro.cpp:51:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while((p1<v1.size()||p2<v2.size())&&V.size()<C+3)
         ~~^~~~~~~~~~
bitaro.cpp:51:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while((p1<v1.size()||p2<v2.size())&&V.size()<C+3)
                       ~~^~~~~~~~~~
bitaro.cpp:54:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(p1<v1.size()) val1 = v1[p1].fi;
      ~~^~~~~~~~~~
bitaro.cpp:55:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(p2<v2.size()) val2 = v2[p2].fi+1;
      ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 10 ms 8192 KB Output is correct
4 Correct 10 ms 8192 KB Output is correct
5 Correct 18 ms 9592 KB Output is correct
6 Correct 18 ms 9472 KB Output is correct
7 Correct 16 ms 9472 KB Output is correct
8 Correct 16 ms 10240 KB Output is correct
9 Correct 19 ms 10240 KB Output is correct
10 Correct 17 ms 10240 KB Output is correct
11 Correct 17 ms 10112 KB Output is correct
12 Correct 15 ms 9728 KB Output is correct
13 Correct 18 ms 10112 KB Output is correct
14 Correct 16 ms 9344 KB Output is correct
15 Correct 14 ms 8960 KB Output is correct
16 Correct 15 ms 9344 KB Output is correct
17 Correct 16 ms 9720 KB Output is correct
18 Correct 14 ms 9216 KB Output is correct
19 Correct 16 ms 9856 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 10 ms 8192 KB Output is correct
4 Correct 10 ms 8192 KB Output is correct
5 Correct 18 ms 9592 KB Output is correct
6 Correct 18 ms 9472 KB Output is correct
7 Correct 16 ms 9472 KB Output is correct
8 Correct 16 ms 10240 KB Output is correct
9 Correct 19 ms 10240 KB Output is correct
10 Correct 17 ms 10240 KB Output is correct
11 Correct 17 ms 10112 KB Output is correct
12 Correct 15 ms 9728 KB Output is correct
13 Correct 18 ms 10112 KB Output is correct
14 Correct 16 ms 9344 KB Output is correct
15 Correct 14 ms 8960 KB Output is correct
16 Correct 15 ms 9344 KB Output is correct
17 Correct 16 ms 9720 KB Output is correct
18 Correct 14 ms 9216 KB Output is correct
19 Correct 16 ms 9856 KB Output is correct
20 Correct 499 ms 12664 KB Output is correct
21 Correct 607 ms 12664 KB Output is correct
22 Correct 530 ms 12728 KB Output is correct
23 Correct 594 ms 12644 KB Output is correct
24 Correct 961 ms 173820 KB Output is correct
25 Correct 863 ms 173360 KB Output is correct
26 Correct 827 ms 173684 KB Output is correct
27 Correct 897 ms 217728 KB Output is correct
28 Correct 992 ms 217868 KB Output is correct
29 Correct 853 ms 217560 KB Output is correct
30 Correct 898 ms 217028 KB Output is correct
31 Correct 914 ms 212980 KB Output is correct
32 Correct 891 ms 216960 KB Output is correct
33 Correct 734 ms 139148 KB Output is correct
34 Correct 696 ms 120548 KB Output is correct
35 Correct 756 ms 138232 KB Output is correct
36 Correct 933 ms 179196 KB Output is correct
37 Correct 863 ms 168384 KB Output is correct
38 Correct 890 ms 179444 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 10 ms 8192 KB Output is correct
4 Correct 10 ms 8192 KB Output is correct
5 Correct 18 ms 9592 KB Output is correct
6 Correct 18 ms 9472 KB Output is correct
7 Correct 16 ms 9472 KB Output is correct
8 Correct 16 ms 10240 KB Output is correct
9 Correct 19 ms 10240 KB Output is correct
10 Correct 17 ms 10240 KB Output is correct
11 Correct 17 ms 10112 KB Output is correct
12 Correct 15 ms 9728 KB Output is correct
13 Correct 18 ms 10112 KB Output is correct
14 Correct 16 ms 9344 KB Output is correct
15 Correct 14 ms 8960 KB Output is correct
16 Correct 15 ms 9344 KB Output is correct
17 Correct 16 ms 9720 KB Output is correct
18 Correct 14 ms 9216 KB Output is correct
19 Correct 16 ms 9856 KB Output is correct
20 Correct 499 ms 12664 KB Output is correct
21 Correct 607 ms 12664 KB Output is correct
22 Correct 530 ms 12728 KB Output is correct
23 Correct 594 ms 12644 KB Output is correct
24 Correct 961 ms 173820 KB Output is correct
25 Correct 863 ms 173360 KB Output is correct
26 Correct 827 ms 173684 KB Output is correct
27 Correct 897 ms 217728 KB Output is correct
28 Correct 992 ms 217868 KB Output is correct
29 Correct 853 ms 217560 KB Output is correct
30 Correct 898 ms 217028 KB Output is correct
31 Correct 914 ms 212980 KB Output is correct
32 Correct 891 ms 216960 KB Output is correct
33 Correct 734 ms 139148 KB Output is correct
34 Correct 696 ms 120548 KB Output is correct
35 Correct 756 ms 138232 KB Output is correct
36 Correct 933 ms 179196 KB Output is correct
37 Correct 863 ms 168384 KB Output is correct
38 Correct 890 ms 179444 KB Output is correct
39 Correct 1078 ms 171408 KB Output is correct
40 Correct 1000 ms 171856 KB Output is correct
41 Correct 892 ms 172044 KB Output is correct
42 Correct 1158 ms 173176 KB Output is correct
43 Correct 959 ms 172508 KB Output is correct
44 Incorrect 616 ms 13240 KB Output isn't correct
45 Halted 0 ms 0 KB -