oj.uz

Submission #151282

# Submission time Handle Problem Language Result Execution time Memory
151282 2019-09-02T11:41:37 Z cheetose Bitaro’s Party (JOI18_bitaro) C++11
100 / 100
 1928 ms 414208 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

const int sq=300;
Vi v[100001];
int d[100001];
bool chk[100001],cc[100001];
Pi tmp[sq+5];
VPi res[100001];
int n,m,q;
void merge(VPi &a,VPi &b)
{
	int c=0,N=a.size(),M=b.size(),i=0,j=0;
	while(c<=sq && i<N && j<M)
	{
		if(cc[a[i].Y])
		{
			i++;
			continue;
		}
		if(cc[b[j].Y])
		{
			j++;
			continue;
		}
		if(a[i].X>b[j].X+1)
		{
			tmp[c++]=mp(a[i].X,a[i].Y);
			cc[a[i].Y]=1;
			i++;
		}
		else
		{
			tmp[c++]=mp(b[j].X+1,b[j].Y);
			cc[b[j].Y]=1;
			j++;
		}
	}
	while(c<=sq && i<N)
	{
		if(cc[a[i].Y])
		{
			i++;
			continue;
		}
		tmp[c++]=mp(a[i].X,a[i].Y);
		cc[a[i].Y]=1;
		i++;
	}
	while(c<=sq && j<M)
	{
		if(cc[b[j].Y])
		{
			j++;
			continue;
		}
		tmp[c++]=mp(b[j].X+1,b[j].Y);
		cc[b[j].Y]=1;
		j++;
	}
	a.clear();
	fup(i,0,c-1,1)
	{
		a.pb(tmp[i]);
		cc[tmp[i].Y]=0;
	}
}
int main() {
	scanf("%d%d%d",&n,&m,&q);
	fup(i,0,m-1,1)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		v[y].pb(x);
	}
	fup(i,1,n,1)
	{
		res[i].pb(mp(0,i));
		for(int next:v[i])merge(res[i],res[next]);
	}
	while(q--)
	{
		Vi vv;
		int x,k;
		scanf("%d%d",&x,&k);
		vv.resize(k);
		fup(i,0,k-1,1)
		{
			scanf("%d",&vv[i]);
			chk[vv[i]]=1;
		}
		if(k>=sq)
		{
			fup(i,1,n,1)d[i]=-INF;
			d[x]=0;
			int ans=-1;
			fdn(i,x,1,1)
			{
				if(!chk[i])ans=max(ans,d[i]);
				for(int y:v[i])d[y]=max(d[y],d[i]+1);
			}
			printf("%d\n",ans);
		}
		else
		{
			int ans=-1;
			for(auto p:res[x])
			{
				if(!chk[p.Y])ans=max(ans,p.X);
			}
			printf("%d\n",ans);
		}
		fup(i,0,k-1,1)chk[vv[i]]=0;
	}
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:128:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&n,&m,&q);
  ~~~~~^~~~~~~~~~~~~~~~~~~
bitaro.cpp:132:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&x,&y);
   ~~~~~^~~~~~~~~~~~~~
bitaro.cpp:144:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&x,&k);
   ~~~~~^~~~~~~~~~~~~~
bitaro.cpp:148:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&vv[i]);
    ~~~~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 10 ms 5496 KB Output is correct
6 Correct 10 ms 5752 KB Output is correct
7 Correct 9 ms 5496 KB Output is correct
8 Correct 17 ms 8440 KB Output is correct
9 Correct 17 ms 8440 KB Output is correct
10 Correct 17 ms 8444 KB Output is correct
11 Correct 18 ms 8056 KB Output is correct
12 Correct 11 ms 6392 KB Output is correct
13 Correct 18 ms 7800 KB Output is correct
14 Correct 15 ms 7032 KB Output is correct
15 Correct 12 ms 6008 KB Output is correct
16 Correct 15 ms 7032 KB Output is correct
17 Correct 15 ms 7288 KB Output is correct
18 Correct 12 ms 6220 KB Output is correct
19 Correct 14 ms 7288 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 10 ms 5496 KB Output is correct
6 Correct 10 ms 5752 KB Output is correct
7 Correct 9 ms 5496 KB Output is correct
8 Correct 17 ms 8440 KB Output is correct
9 Correct 17 ms 8440 KB Output is correct
10 Correct 17 ms 8444 KB Output is correct
11 Correct 18 ms 8056 KB Output is correct
12 Correct 11 ms 6392 KB Output is correct
13 Correct 18 ms 7800 KB Output is correct
14 Correct 15 ms 7032 KB Output is correct
15 Correct 12 ms 6008 KB Output is correct
16 Correct 15 ms 7032 KB Output is correct
17 Correct 15 ms 7288 KB Output is correct
18 Correct 12 ms 6220 KB Output is correct
19 Correct 14 ms 7288 KB Output is correct
20 Correct 691 ms 11148 KB Output is correct
21 Correct 684 ms 11104 KB Output is correct
22 Correct 684 ms 11112 KB Output is correct
23 Correct 744 ms 11212 KB Output is correct
24 Correct 1157 ms 254220 KB Output is correct
25 Correct 1170 ms 265720 KB Output is correct
26 Correct 1149 ms 264712 KB Output is correct
27 Correct 1348 ms 413436 KB Output is correct
28 Correct 1317 ms 413320 KB Output is correct
29 Correct 1319 ms 413152 KB Output is correct
30 Correct 1370 ms 412788 KB Output is correct
31 Correct 1378 ms 398444 KB Output is correct
32 Correct 1318 ms 412688 KB Output is correct
33 Correct 1034 ms 255348 KB Output is correct
34 Correct 888 ms 209016 KB Output is correct
35 Correct 982 ms 253588 KB Output is correct
36 Correct 1159 ms 334128 KB Output is correct
37 Correct 1152 ms 302336 KB Output is correct
38 Correct 1160 ms 335252 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 10 ms 5496 KB Output is correct
6 Correct 10 ms 5752 KB Output is correct
7 Correct 9 ms 5496 KB Output is correct
8 Correct 17 ms 8440 KB Output is correct
9 Correct 17 ms 8440 KB Output is correct
10 Correct 17 ms 8444 KB Output is correct
11 Correct 18 ms 8056 KB Output is correct
12 Correct 11 ms 6392 KB Output is correct
13 Correct 18 ms 7800 KB Output is correct
14 Correct 15 ms 7032 KB Output is correct
15 Correct 12 ms 6008 KB Output is correct
16 Correct 15 ms 7032 KB Output is correct
17 Correct 15 ms 7288 KB Output is correct
18 Correct 12 ms 6220 KB Output is correct
19 Correct 14 ms 7288 KB Output is correct
20 Correct 691 ms 11148 KB Output is correct
21 Correct 684 ms 11104 KB Output is correct
22 Correct 684 ms 11112 KB Output is correct
23 Correct 744 ms 11212 KB Output is correct
24 Correct 1157 ms 254220 KB Output is correct
25 Correct 1170 ms 265720 KB Output is correct
26 Correct 1149 ms 264712 KB Output is correct
27 Correct 1348 ms 413436 KB Output is correct
28 Correct 1317 ms 413320 KB Output is correct
29 Correct 1319 ms 413152 KB Output is correct
30 Correct 1370 ms 412788 KB Output is correct
31 Correct 1378 ms 398444 KB Output is correct
32 Correct 1318 ms 412688 KB Output is correct
33 Correct 1034 ms 255348 KB Output is correct
34 Correct 888 ms 209016 KB Output is correct
35 Correct 982 ms 253588 KB Output is correct
36 Correct 1159 ms 334128 KB Output is correct
37 Correct 1152 ms 302336 KB Output is correct
38 Correct 1160 ms 335252 KB Output is correct
39 Correct 1230 ms 258280 KB Output is correct
40 Correct 1163 ms 259756 KB Output is correct
41 Correct 1153 ms 262520 KB Output is correct
42 Correct 1305 ms 260696 KB Output is correct
43 Correct 1157 ms 260032 KB Output is correct
44 Correct 762 ms 12392 KB Output is correct
45 Correct 705 ms 11600 KB Output is correct
46 Correct 697 ms 11440 KB Output is correct
47 Correct 726 ms 11420 KB Output is correct
48 Correct 685 ms 11144 KB Output is correct
49 Correct 1459 ms 413848 KB Output is correct
50 Correct 1318 ms 412460 KB Output is correct
51 Correct 761 ms 12232 KB Output is correct
52 Correct 695 ms 11364 KB Output is correct
53 Correct 1288 ms 333020 KB Output is correct
54 Correct 1287 ms 303220 KB Output is correct
55 Correct 1182 ms 332684 KB Output is correct
56 Correct 1161 ms 302880 KB Output is correct
57 Correct 758 ms 12280 KB Output is correct
58 Correct 768 ms 12152 KB Output is correct
59 Correct 697 ms 11636 KB Output is correct
60 Correct 694 ms 11384 KB Output is correct
61 Correct 1477 ms 412980 KB Output is correct
62 Correct 1321 ms 334320 KB Output is correct
63 Correct 1380 ms 301888 KB Output is correct
64 Correct 1928 ms 412916 KB Output is correct
65 Correct 1635 ms 332888 KB Output is correct
66 Correct 1570 ms 303448 KB Output is correct
67 Correct 1335 ms 412580 KB Output is correct
68 Correct 1211 ms 334000 KB Output is correct
69 Correct 1132 ms 299168 KB Output is correct
70 Correct 1388 ms 413128 KB Output is correct
71 Correct 1176 ms 334340 KB Output is correct
72 Correct 1174 ms 303256 KB Output is correct
73 Correct 1380 ms 413104 KB Output is correct
74 Correct 1232 ms 334328 KB Output is correct
75 Correct 1207 ms 303040 KB Output is correct
76 Correct 1507 ms 414208 KB Output is correct
77 Correct 1364 ms 412852 KB Output is correct
78 Correct 1330 ms 413432 KB Output is correct
79 Correct 762 ms 12384 KB Output is correct
80 Correct 845 ms 11484 KB Output is correct
81 Correct 690 ms 11096 KB Output is correct
82 Correct 1467 ms 413748 KB Output is correct
83 Correct 1556 ms 399296 KB Output is correct
84 Correct 1346 ms 412532 KB Output is correct
85 Correct 1438 ms 397824 KB Output is correct
86 Correct 1335 ms 412944 KB Output is correct
87 Correct 1432 ms 399084 KB Output is correct
88 Correct 760 ms 12436 KB Output is correct
89 Correct 763 ms 12536 KB Output is correct
90 Correct 704 ms 11444 KB Output is correct
91 Correct 691 ms 11324 KB Output is correct
92 Correct 691 ms 11092 KB Output is correct
93 Correct 681 ms 11092 KB Output is correct
94 Correct 1117 ms 256364 KB Output is correct
95 Correct 996 ms 208904 KB Output is correct
96 Correct 999 ms 253788 KB Output is correct
97 Correct 904 ms 211752 KB Output is correct
98 Correct 1016 ms 255280 KB Output is correct
99 Correct 909 ms 211716 KB Output is correct
100 Correct 824 ms 12424 KB Output is correct
101 Correct 825 ms 12452 KB Output is correct
102 Correct 750 ms 11512 KB Output is correct
103 Correct 758 ms 11420 KB Output is correct
104 Correct 746 ms 11140 KB Output is correct
105 Correct 744 ms 11012 KB Output is correct
106 Correct 1354 ms 334072 KB Output is correct
107 Correct 1278 ms 303872 KB Output is correct
108 Correct 1166 ms 334936 KB Output is correct
109 Correct 1156 ms 302280 KB Output is correct
110 Correct 1208 ms 335544 KB Output is correct
111 Correct 1196 ms 303732 KB Output is correct
112 Correct 764 ms 12452 KB Output is correct
113 Correct 760 ms 12304 KB Output is correct
114 Correct 698 ms 11484 KB Output is correct
115 Correct 705 ms 11412 KB Output is correct
116 Correct 687 ms 11148 KB Output is correct
117 Correct 692 ms 11020 KB Output is correct
118 Correct 1334 ms 412540 KB Output is correct
119 Correct 1177 ms 334512 KB Output is correct
120 Correct 1144 ms 301924 KB Output is correct
121 Correct 1324 ms 412688 KB Output is correct
122 Correct 1179 ms 333108 KB Output is correct
123 Correct 1154 ms 302068 KB Output is correct
124 Correct 1316 ms 412624 KB Output is correct
125 Correct 1200 ms 334736 KB Output is correct
126 Correct 1152 ms 300820 KB Output is correct