oj.uz

Submission #111743

# Submission time Handle Problem Language Result Execution time Memory
111743 2019-05-16T05:32:39 Z zscoder Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 1989 ms 217476 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 = 250;
 
vi adj[111111];
vi radj[111111];
vector<ii> dp[111111];
int n,m,q; 
bool isbad[111111];
 
void solve_large(int u)
{
	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';
}
 
bool appeared[111111];
vector<ii> mergevector(vector<ii> &v1, vector<ii> &v2)
{
	vector<ii> V; vi A;
	int p1 = 0; int p2 = 0;
	while((p1<v1.size()||p2<v2.size())&&V.size()<C+1)
	{
		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));
			appeared[v1[p1].se]=1;A.pb(v1[p1].se);
			p1++;
		}
		else
		{
			V.pb(mp(val2, v2[p2].se));
			appeared[v2[p2].se]=1;A.pb(v2[p2].se);
			p2++;
		}
		while(p1<v1.size()&&appeared[v1[p1].se]) p1++;
		while(p2<v2.size()&&appeared[v2[p2].se]) p2++;
	}
	for(int x:A) appeared[x]=0;
	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);
		}
		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:52:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while((p1<v1.size()||p2<v2.size())&&V.size()<C+1)
         ~~^~~~~~~~~~
bitaro.cpp:52:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while((p1<v1.size()||p2<v2.size())&&V.size()<C+1)
                       ~~^~~~~~~~~~
bitaro.cpp:55:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(p1<v1.size()) val1 = v1[p1].fi;
      ~~^~~~~~~~~~
bitaro.cpp:56:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(p2<v2.size()) val2 = v2[p2].fi+1;
      ~~^~~~~~~~~~
bitaro.cpp:69:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(p1<v1.size()&&appeared[v1[p1].se]) p1++;
         ~~^~~~~~~~~~
bitaro.cpp:70:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(p2<v2.size()&&appeared[v2[p2].se]) p2++;
         ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 9 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 15 ms 8704 KB Output is correct
6 Correct 14 ms 8636 KB Output is correct
7 Correct 15 ms 8576 KB Output is correct
8 Correct 22 ms 10076 KB Output is correct
9 Correct 19 ms 10112 KB Output is correct
10 Correct 22 ms 10112 KB Output is correct
11 Correct 21 ms 9984 KB Output is correct
12 Correct 15 ms 9472 KB Output is correct
13 Correct 18 ms 9856 KB Output is correct
14 Correct 17 ms 9344 KB Output is correct
15 Correct 14 ms 8896 KB Output is correct
16 Correct 20 ms 9344 KB Output is correct
17 Correct 19 ms 9472 KB Output is correct
18 Correct 16 ms 9088 KB Output is correct
19 Correct 19 ms 9600 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 9 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 15 ms 8704 KB Output is correct
6 Correct 14 ms 8636 KB Output is correct
7 Correct 15 ms 8576 KB Output is correct
8 Correct 22 ms 10076 KB Output is correct
9 Correct 19 ms 10112 KB Output is correct
10 Correct 22 ms 10112 KB Output is correct
11 Correct 21 ms 9984 KB Output is correct
12 Correct 15 ms 9472 KB Output is correct
13 Correct 18 ms 9856 KB Output is correct
14 Correct 17 ms 9344 KB Output is correct
15 Correct 14 ms 8896 KB Output is correct
16 Correct 20 ms 9344 KB Output is correct
17 Correct 19 ms 9472 KB Output is correct
18 Correct 16 ms 9088 KB Output is correct
19 Correct 19 ms 9600 KB Output is correct
20 Correct 925 ms 12344 KB Output is correct
21 Correct 996 ms 12560 KB Output is correct
22 Correct 1045 ms 12412 KB Output is correct
23 Correct 1012 ms 12528 KB Output is correct
24 Correct 1335 ms 156744 KB Output is correct
25 Correct 1258 ms 160912 KB Output is correct
26 Correct 1321 ms 161104 KB Output is correct
27 Correct 1444 ms 217416 KB Output is correct
28 Correct 1357 ms 217456 KB Output is correct
29 Correct 1501 ms 217428 KB Output is correct
30 Correct 1462 ms 216612 KB Output is correct
31 Correct 1450 ms 211408 KB Output is correct
32 Correct 1566 ms 216892 KB Output is correct
33 Correct 1160 ms 139268 KB Output is correct
34 Correct 952 ms 120676 KB Output is correct
35 Correct 1109 ms 138432 KB Output is correct
36 Correct 1361 ms 178620 KB Output is correct
37 Correct 1220 ms 166396 KB Output is correct
38 Correct 1336 ms 179060 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 9 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 15 ms 8704 KB Output is correct
6 Correct 14 ms 8636 KB Output is correct
7 Correct 15 ms 8576 KB Output is correct
8 Correct 22 ms 10076 KB Output is correct
9 Correct 19 ms 10112 KB Output is correct
10 Correct 22 ms 10112 KB Output is correct
11 Correct 21 ms 9984 KB Output is correct
12 Correct 15 ms 9472 KB Output is correct
13 Correct 18 ms 9856 KB Output is correct
14 Correct 17 ms 9344 KB Output is correct
15 Correct 14 ms 8896 KB Output is correct
16 Correct 20 ms 9344 KB Output is correct
17 Correct 19 ms 9472 KB Output is correct
18 Correct 16 ms 9088 KB Output is correct
19 Correct 19 ms 9600 KB Output is correct
20 Correct 925 ms 12344 KB Output is correct
21 Correct 996 ms 12560 KB Output is correct
22 Correct 1045 ms 12412 KB Output is correct
23 Correct 1012 ms 12528 KB Output is correct
24 Correct 1335 ms 156744 KB Output is correct
25 Correct 1258 ms 160912 KB Output is correct
26 Correct 1321 ms 161104 KB Output is correct
27 Correct 1444 ms 217416 KB Output is correct
28 Correct 1357 ms 217456 KB Output is correct
29 Correct 1501 ms 217428 KB Output is correct
30 Correct 1462 ms 216612 KB Output is correct
31 Correct 1450 ms 211408 KB Output is correct
32 Correct 1566 ms 216892 KB Output is correct
33 Correct 1160 ms 139268 KB Output is correct
34 Correct 952 ms 120676 KB Output is correct
35 Correct 1109 ms 138432 KB Output is correct
36 Correct 1361 ms 178620 KB Output is correct
37 Correct 1220 ms 166396 KB Output is correct
38 Correct 1336 ms 179060 KB Output is correct
39 Correct 1370 ms 157616 KB Output is correct
40 Correct 1263 ms 158556 KB Output is correct
41 Correct 1531 ms 158952 KB Output is correct
42 Correct 1545 ms 159676 KB Output is correct
43 Correct 1316 ms 158392 KB Output is correct
44 Correct 1098 ms 12788 KB Output is correct
45 Correct 1123 ms 12604 KB Output is correct
46 Correct 1057 ms 12428 KB Output is correct
47 Correct 1076 ms 12456 KB Output is correct
48 Correct 1055 ms 12540 KB Output is correct
49 Correct 1689 ms 217388 KB Output is correct
50 Correct 1527 ms 216664 KB Output is correct
51 Correct 1010 ms 12880 KB Output is correct
52 Correct 1068 ms 12364 KB Output is correct
53 Correct 1386 ms 177672 KB Output is correct
54 Correct 1422 ms 165788 KB Output is correct
55 Correct 1344 ms 177344 KB Output is correct
56 Correct 1359 ms 166216 KB Output is correct
57 Correct 1088 ms 13020 KB Output is correct
58 Correct 1056 ms 12804 KB Output is correct
59 Correct 1048 ms 12552 KB Output is correct
60 Correct 1160 ms 12464 KB Output is correct
61 Correct 1740 ms 217188 KB Output is correct
62 Correct 1485 ms 178436 KB Output is correct
63 Correct 1488 ms 165476 KB Output is correct
64 Correct 1989 ms 217244 KB Output is correct
65 Correct 1861 ms 177672 KB Output is correct
66 Correct 1853 ms 166724 KB Output is correct
67 Correct 1402 ms 216836 KB Output is correct
68 Correct 1308 ms 177856 KB Output is correct
69 Correct 1219 ms 164060 KB Output is correct
70 Correct 1473 ms 217180 KB Output is correct
71 Correct 1366 ms 178264 KB Output is correct
72 Correct 1377 ms 165932 KB Output is correct
73 Correct 1522 ms 217240 KB Output is correct
74 Correct 1371 ms 178324 KB Output is correct
75 Correct 1381 ms 165852 KB Output is correct
76 Correct 1716 ms 217412 KB Output is correct
77 Correct 1451 ms 216920 KB Output is correct
78 Correct 1448 ms 217476 KB Output is correct
79 Correct 1002 ms 12964 KB Output is correct
80 Correct 991 ms 12540 KB Output is correct
81 Correct 1041 ms 12396 KB Output is correct
82 Correct 1661 ms 216536 KB Output is correct
83 Correct 1715 ms 211256 KB Output is correct
84 Correct 1467 ms 216164 KB Output is correct
85 Correct 1563 ms 210688 KB Output is correct
86 Correct 1330 ms 216532 KB Output is correct
87 Correct 1510 ms 211600 KB Output is correct
88 Correct 979 ms 12792 KB Output is correct
89 Correct 944 ms 12964 KB Output is correct
90 Correct 907 ms 12408 KB Output is correct
91 Correct 1114 ms 12564 KB Output is correct
92 Correct 983 ms 12512 KB Output is correct
93 Correct 1040 ms 12408 KB Output is correct
94 Correct 1357 ms 139128 KB Output is correct
95 Correct 1220 ms 119928 KB Output is correct
96 Correct 1304 ms 138104 KB Output is correct
97 Correct 1071 ms 121520 KB Output is correct
98 Correct 1102 ms 139080 KB Output is correct
99 Correct 1150 ms 121708 KB Output is correct
100 Correct 1030 ms 12892 KB Output is correct
101 Correct 1090 ms 12796 KB Output is correct
102 Correct 1060 ms 12536 KB Output is correct
103 Correct 1067 ms 12484 KB Output is correct
104 Correct 1048 ms 12536 KB Output is correct
105 Correct 1069 ms 12588 KB Output is correct
106 Correct 1398 ms 177764 KB Output is correct
107 Correct 1326 ms 166276 KB Output is correct
108 Correct 1360 ms 178304 KB Output is correct
109 Correct 1280 ms 165368 KB Output is correct
110 Correct 1217 ms 179068 KB Output is correct
111 Correct 1282 ms 166736 KB Output is correct
112 Correct 1176 ms 12948 KB Output is correct
113 Correct 1044 ms 12796 KB Output is correct
114 Correct 1104 ms 12664 KB Output is correct
115 Correct 1077 ms 12472 KB Output is correct
116 Correct 1077 ms 12392 KB Output is correct
117 Correct 1093 ms 12380 KB Output is correct
118 Correct 1568 ms 216824 KB Output is correct
119 Correct 1341 ms 178256 KB Output is correct
120 Correct 1373 ms 165404 KB Output is correct
121 Correct 1556 ms 216824 KB Output is correct
122 Correct 1305 ms 177536 KB Output is correct
123 Correct 1211 ms 165112 KB Output is correct
124 Correct 1582 ms 216696 KB Output is correct
125 Correct 1370 ms 178552 KB Output is correct
126 Correct 1355 ms 164852 KB Output is correct