oj.uz

Submission #95094

# Submission time Handle Problem Language Result Execution time Memory
95094 2019-01-27T09:03:20 Z omidazadi Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 2000 ms 14712 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ld long double
#define pll pair <ll , ll>

#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define mp make_pair

#define X first
#define Y second

#define LB(x) ((x) & -(x))
#define BIT(x , y) (((x) >> (y)) & 1)

#define ll int

const ll MAXN=1e5+10;
const ll SQ=0;

vector <pll> e[MAXN];
vector <ll> in[MAXN];
vector <ll> out[MAXN];

vector <pll> f;

ll w[MAXN];
ll z[MAXN];
ll dp[MAXN];

int main()
{
	ios_base :: sync_with_stdio(false);
	cin.tie(0);

	ll n , m , q;
	cin>>n>>m>>q;

	for(ll i=1;i<=m;i++)
	{
		ll v , u;
		cin>>v>>u;

		out[v].pb(u);
		in[u].pb(v);
	}

	for(ll i=1;i<=n;i++)
	{
		for(ll j=0;j<in[i].size();j++)
		{
			ll v=in[i][j];

			for(ll u=0;u<e[v].size();u++)
			{
				f.pb(mp(e[v][u].X+1 , e[v][u].Y));
			}
		}

		sort(f.begin() , f.end() , std::greater<pll>());

		for(ll j=0;j<f.size();j++)
		{
			if (e[i].size()==SQ)
			{
				break;
			}

			if (w[f[j].Y]!=i)
			{
				w[f[j].Y]=i;
				e[i].pb(f[j]);
			}
		}

		if (e[i].size()<SQ)
		{
			e[i].pb(mp(0 , i));
		}

		f.clear();
	}

	for(ll i=1;i<=q;i++)
	{
		ll t , y;
		cin>>t>>y;

		for(ll j=1;j<=y;j++)
		{
			ll x;
			cin>>x;

			z[x]=i;
		}

		if (y>=SQ)
		{
			ll res=-1;

			for(ll j=t;j>=1;j--)
			{
				dp[j]=(j==t ? 0 : -1);

				for(ll u=0;u<out[j].size();u++)
				{
					if (out[j][u]<=t && dp[out[j][u]]!=-1)
					{
						dp[j]=max(dp[j] , dp[out[j][u]]+1);
					}
				}

				if (z[j]!=i)
				{
					res=max(res , dp[j]);
				}
			}

			cout<<res<<endl;
		}
		else
		{
			bool flag=false;

			for(ll j=0;j<e[t].size();j++)
			{
				if (z[e[t][j].Y]!=i)
				{
					cout<<e[t][j].X<<endl;
					flag=true;
					break;
				}
			}

			if (!flag)
			{
				cout<<-1<<endl;
			}
		}
	}
}

Compilation message

bitaro.cpp:21:0: warning: "ll" redefined
 #define ll int
 
bitaro.cpp:5:0: note: this is the location of the previous definition
 #define ll long long
 
bitaro.cpp: In function 'int main()':
bitaro.cpp:55:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(ll j=0;j<in[i].size();j++)
              ~^~~~~~~~~~~~~
bitaro.cpp:59:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(ll u=0;u<e[v].size();u++)
               ~^~~~~~~~~~~~
bitaro.cpp:67:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(ll j=0;j<f.size();j++)
              ~^~~~~~~~~
bitaro.cpp:110:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(ll u=0;u<out[j].size();u++)
                ~^~~~~~~~~~~~~~
bitaro.cpp:130:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(ll j=0;j<e[t].size();j++)
               ~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7416 KB Output is correct
2 Correct 7 ms 7416 KB Output is correct
3 Correct 24 ms 7416 KB Output is correct
4 Correct 7 ms 7416 KB Output is correct
5 Correct 7 ms 7416 KB Output is correct
6 Correct 7 ms 7416 KB Output is correct
7 Correct 7 ms 7416 KB Output is correct
8 Correct 8 ms 7416 KB Output is correct
9 Correct 7 ms 7544 KB Output is correct
10 Correct 7 ms 7416 KB Output is correct
11 Correct 7 ms 7416 KB Output is correct
12 Correct 7 ms 7544 KB Output is correct
13 Correct 7 ms 7416 KB Output is correct
14 Correct 7 ms 7416 KB Output is correct
15 Correct 8 ms 7416 KB Output is correct
16 Correct 7 ms 7416 KB Output is correct
17 Correct 8 ms 7416 KB Output is correct
18 Correct 7 ms 7416 KB Output is correct
19 Correct 7 ms 7544 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7416 KB Output is correct
2 Correct 7 ms 7416 KB Output is correct
3 Correct 24 ms 7416 KB Output is correct
4 Correct 7 ms 7416 KB Output is correct
5 Correct 7 ms 7416 KB Output is correct
6 Correct 7 ms 7416 KB Output is correct
7 Correct 7 ms 7416 KB Output is correct
8 Correct 8 ms 7416 KB Output is correct
9 Correct 7 ms 7544 KB Output is correct
10 Correct 7 ms 7416 KB Output is correct
11 Correct 7 ms 7416 KB Output is correct
12 Correct 7 ms 7544 KB Output is correct
13 Correct 7 ms 7416 KB Output is correct
14 Correct 7 ms 7416 KB Output is correct
15 Correct 8 ms 7416 KB Output is correct
16 Correct 7 ms 7416 KB Output is correct
17 Correct 8 ms 7416 KB Output is correct
18 Correct 7 ms 7416 KB Output is correct
19 Correct 7 ms 7544 KB Output is correct
20 Correct 46 ms 9848 KB Output is correct
21 Correct 45 ms 9864 KB Output is correct
22 Correct 42 ms 9852 KB Output is correct
23 Correct 43 ms 9848 KB Output is correct
24 Correct 142 ms 13184 KB Output is correct
25 Correct 136 ms 13184 KB Output is correct
26 Correct 129 ms 12904 KB Output is correct
27 Correct 121 ms 14584 KB Output is correct
28 Correct 96 ms 14712 KB Output is correct
29 Correct 111 ms 14712 KB Output is correct
30 Correct 123 ms 13916 KB Output is correct
31 Correct 126 ms 13948 KB Output is correct
32 Correct 111 ms 13660 KB Output is correct
33 Correct 120 ms 13660 KB Output is correct
34 Correct 138 ms 14200 KB Output is correct
35 Correct 125 ms 13688 KB Output is correct
36 Correct 115 ms 14200 KB Output is correct
37 Correct 117 ms 13916 KB Output is correct
38 Correct 104 ms 13816 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7416 KB Output is correct
2 Correct 7 ms 7416 KB Output is correct
3 Correct 24 ms 7416 KB Output is correct
4 Correct 7 ms 7416 KB Output is correct
5 Correct 7 ms 7416 KB Output is correct
6 Correct 7 ms 7416 KB Output is correct
7 Correct 7 ms 7416 KB Output is correct
8 Correct 8 ms 7416 KB Output is correct
9 Correct 7 ms 7544 KB Output is correct
10 Correct 7 ms 7416 KB Output is correct
11 Correct 7 ms 7416 KB Output is correct
12 Correct 7 ms 7544 KB Output is correct
13 Correct 7 ms 7416 KB Output is correct
14 Correct 7 ms 7416 KB Output is correct
15 Correct 8 ms 7416 KB Output is correct
16 Correct 7 ms 7416 KB Output is correct
17 Correct 8 ms 7416 KB Output is correct
18 Correct 7 ms 7416 KB Output is correct
19 Correct 7 ms 7544 KB Output is correct
20 Correct 46 ms 9848 KB Output is correct
21 Correct 45 ms 9864 KB Output is correct
22 Correct 42 ms 9852 KB Output is correct
23 Correct 43 ms 9848 KB Output is correct
24 Correct 142 ms 13184 KB Output is correct
25 Correct 136 ms 13184 KB Output is correct
26 Correct 129 ms 12904 KB Output is correct
27 Correct 121 ms 14584 KB Output is correct
28 Correct 96 ms 14712 KB Output is correct
29 Correct 111 ms 14712 KB Output is correct
30 Correct 123 ms 13916 KB Output is correct
31 Correct 126 ms 13948 KB Output is correct
32 Correct 111 ms 13660 KB Output is correct
33 Correct 120 ms 13660 KB Output is correct
34 Correct 138 ms 14200 KB Output is correct
35 Correct 125 ms 13688 KB Output is correct
36 Correct 115 ms 14200 KB Output is correct
37 Correct 117 ms 13916 KB Output is correct
38 Correct 104 ms 13816 KB Output is correct
39 Execution timed out 2054 ms 13444 KB Time limit exceeded
40 Halted 0 ms 0 KB -