oj.uz

Submission #338773

# Submission time Handle Problem Language Result Execution time Memory
338773 2020-12-23T21:13:39 Z ogibogi2004 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 63844 KB 
#include<bits/stdc++.h>
using namespace std;
const int MAXN=3e4+2;
const int INF=2e9;
int n,m;
struct doge
{
	int p,pos;
	bool operator<(const doge& other)
	{
		if(pos!=other.pos)return pos<other.pos;
		return p<=other.p;
	}
}d[MAXN];
struct state
{
	int pos,p,d;
	bool operator<(state const& other)const
	{
		if(d!=other.d)return d>other.d;
		return make_pair(p,pos)<make_pair(other.p,other.pos);
	}
};
set<pair<int,int> >doges;
set<int>doges1[MAXN];
vector<int>states;
map<int,int>dist;
int main()
{
	srand(654);
	int e=rand();
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cin>>n>>m;
	for(int i=0;i<m;++i)
	{
		cin>>d[i].pos>>d[i].p;
		doges.insert({d[i].p,d[i].pos%d[i].p});
		doges1[d[i].pos].insert(d[i].p);
	}
	for(auto t:doges)
	{
		for(int i=t.second;i<n;i+=t.first)
		{
			states.push_back(i*MAXN+t.first);
		}
	}
	//dist.reserve(states.size());
	for(auto s:states)
	{
		dist[(s^e)]=INF;
	}
	priority_queue<state>pq;
	pq.push({d[0].pos,d[0].p,0});
	dist[(d[0].pos*MAXN+d[0].p)^e]=0;
	while(!pq.empty())
	{
		state u=pq.top();pq.pop();
		if(dist[(u.pos*MAXN+u.p)^e]<u.d)continue;
		if(u.pos==d[1].pos&&u.p==d[1].p)break;
		//if(clock()>0.9*CLOCKS_PER_SEC)break;
		//cout<<u.pos<<" "<<u.p<<endl;
		if(doges1[u.pos].size()>0)
		{
			auto it=doges1[u.pos].lower_bound(u.p);
			if(it!=doges1[u.pos].end()&&(*it)!=u.p)
			{
				auto d1=(*it);
				if(dist[(u.pos*MAXN+d1)^e]>u.d)
				{
					dist[(u.pos*MAXN+d1)^e]=u.d;
					pq.push({u.pos,d1,u.d});
				}
			}
			if(it!=doges1[u.pos].begin())
			{
				--it;
				auto d1=(*it);
				if(dist[(u.pos*MAXN+d1)^e]>u.d)
				{
					dist[(u.pos*MAXN+d1)^e]=u.d;
					pq.push({u.pos,d1,u.d});
				}
				++it;
			}
			//cout<<"**\n";
			if(it!=doges1[u.pos].end())++it;
			if(it!=doges1[u.pos].end())
			{
				auto d1=(*it);
				if(dist[(u.pos*MAXN+d1)^e]>u.d)
				{
					dist[(u.pos*MAXN+d1)^e]=u.d;
					pq.push({u.pos,d1,u.d});
				}
			}
		}
		//cout<<"***\n";
		/*for(auto d1:doges1[u.pos])
		{
			if(dist[(u.pos*MAXN+d1)^e]>u.d)
			{
				dist[(u.pos*MAXN+d1)^e]=u.d;
				pq.push({u.pos,d1,u.d});
			}
		}*/
		state v=u;
		if(v.pos+v.p<n)
		{
			v.pos+=v.p;
			if(dist[(v.pos*MAXN+v.p)^e]>u.d+1)
			{
				v.d=u.d+1;
				dist[(v.pos*MAXN+v.p)^e]=v.d;
				pq.push(v);
			}
		}
		v=u;
		if(v.pos-v.p>=0)
		{
			v.pos-=v.p;
			if(dist[(v.pos*MAXN+v.p)^e]>u.d+1)
			{
				v.d=u.d+1;
				dist[(v.pos*MAXN+v.p)^e]=v.d;
				pq.push(v);
			}
		}
	}
	if(dist[(d[1].pos*MAXN+d[1].p)^e]==INF)
	{
		cout<<-1<<"\n";
	}
	else cout<<dist[(d[1].pos*MAXN+d[1].p)^e]<<"\n";
return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1772 KB Output is correct
2 Correct 1 ms 1772 KB Output is correct
3 Correct 1 ms 1772 KB Output is correct
4 Correct 1 ms 1772 KB Output is correct
5 Correct 1 ms 1772 KB Output is correct
6 Correct 1 ms 1772 KB Output is correct
7 Correct 1 ms 1772 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1772 KB Output is correct
2 Correct 1 ms 1772 KB Output is correct
3 Correct 1 ms 1772 KB Output is correct
4 Correct 1 ms 1772 KB Output is correct
5 Correct 1 ms 1772 KB Output is correct
6 Correct 1 ms 1772 KB Output is correct
7 Correct 1 ms 1772 KB Output is correct
8 Correct 1 ms 1772 KB Output is correct
9 Correct 1 ms 1772 KB Output is correct
10 Correct 2 ms 1900 KB Output is correct
11 Correct 3 ms 2156 KB Output is correct
12 Correct 2 ms 1900 KB Output is correct
13 Correct 2 ms 1772 KB Output is correct
14 Correct 7 ms 2284 KB Output is correct
15 Correct 6 ms 2284 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1772 KB Output is correct
2 Correct 1 ms 1772 KB Output is correct
3 Correct 1 ms 1772 KB Output is correct
4 Correct 1 ms 1772 KB Output is correct
5 Correct 1 ms 1772 KB Output is correct
6 Correct 1 ms 1772 KB Output is correct
7 Correct 1 ms 1792 KB Output is correct
8 Correct 1 ms 1772 KB Output is correct
9 Correct 2 ms 1772 KB Output is correct
10 Correct 2 ms 1900 KB Output is correct
11 Correct 3 ms 2156 KB Output is correct
12 Correct 2 ms 1772 KB Output is correct
13 Correct 2 ms 1772 KB Output is correct
14 Correct 7 ms 2284 KB Output is correct
15 Correct 6 ms 2284 KB Output is correct
16 Correct 3 ms 2028 KB Output is correct
17 Correct 9 ms 2668 KB Output is correct
18 Correct 3 ms 2156 KB Output is correct
19 Correct 3 ms 2028 KB Output is correct
20 Correct 3 ms 1900 KB Output is correct
21 Correct 2 ms 2028 KB Output is correct
22 Correct 3 ms 2156 KB Output is correct
23 Correct 6 ms 2156 KB Output is correct
24 Correct 11 ms 2540 KB Output is correct
25 Correct 4 ms 2284 KB Output is correct
26 Correct 4 ms 2156 KB Output is correct
27 Correct 5 ms 2156 KB Output is correct
28 Correct 19 ms 3052 KB Output is correct
29 Correct 59 ms 4968 KB Output is correct
30 Correct 15 ms 2668 KB Output is correct
31 Correct 31 ms 3560 KB Output is correct
32 Correct 21 ms 3052 KB Output is correct
33 Correct 135 ms 8164 KB Output is correct
34 Correct 98 ms 8164 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1772 KB Output is correct
2 Correct 1 ms 1772 KB Output is correct
3 Correct 1 ms 1772 KB Output is correct
4 Correct 1 ms 1772 KB Output is correct
5 Correct 1 ms 1772 KB Output is correct
6 Correct 1 ms 1772 KB Output is correct
7 Correct 1 ms 1772 KB Output is correct
8 Correct 1 ms 1772 KB Output is correct
9 Correct 1 ms 1772 KB Output is correct
10 Correct 2 ms 1900 KB Output is correct
11 Correct 4 ms 2156 KB Output is correct
12 Correct 2 ms 1772 KB Output is correct
13 Correct 2 ms 1772 KB Output is correct
14 Correct 7 ms 2284 KB Output is correct
15 Correct 6 ms 2284 KB Output is correct
16 Correct 3 ms 2028 KB Output is correct
17 Correct 9 ms 2668 KB Output is correct
18 Correct 3 ms 2156 KB Output is correct
19 Correct 3 ms 2028 KB Output is correct
20 Correct 3 ms 1900 KB Output is correct
21 Correct 2 ms 2028 KB Output is correct
22 Correct 3 ms 2156 KB Output is correct
23 Correct 6 ms 2156 KB Output is correct
24 Correct 14 ms 2540 KB Output is correct
25 Correct 4 ms 2284 KB Output is correct
26 Correct 4 ms 2156 KB Output is correct
27 Correct 5 ms 2156 KB Output is correct
28 Correct 19 ms 3052 KB Output is correct
29 Correct 60 ms 4968 KB Output is correct
30 Correct 15 ms 2668 KB Output is correct
31 Correct 32 ms 3560 KB Output is correct
32 Correct 22 ms 3052 KB Output is correct
33 Correct 135 ms 8164 KB Output is correct
34 Correct 99 ms 8164 KB Output is correct
35 Correct 107 ms 9832 KB Output is correct
36 Correct 10 ms 3180 KB Output is correct
37 Correct 120 ms 12896 KB Output is correct
38 Correct 108 ms 13156 KB Output is correct
39 Correct 97 ms 12900 KB Output is correct
40 Correct 104 ms 13032 KB Output is correct
41 Correct 150 ms 13540 KB Output is correct
42 Correct 8 ms 2412 KB Output is correct
43 Correct 11 ms 2412 KB Output is correct
44 Correct 7 ms 2156 KB Output is correct
45 Correct 902 ms 30172 KB Output is correct
46 Correct 631 ms 30160 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1772 KB Output is correct
2 Correct 1 ms 1772 KB Output is correct
3 Correct 1 ms 1772 KB Output is correct
4 Correct 1 ms 1772 KB Output is correct
5 Correct 1 ms 1772 KB Output is correct
6 Correct 1 ms 1772 KB Output is correct
7 Correct 1 ms 1772 KB Output is correct
8 Correct 1 ms 1772 KB Output is correct
9 Correct 1 ms 1772 KB Output is correct
10 Correct 2 ms 1900 KB Output is correct
11 Correct 3 ms 2156 KB Output is correct
12 Correct 2 ms 1772 KB Output is correct
13 Correct 2 ms 1772 KB Output is correct
14 Correct 7 ms 2284 KB Output is correct
15 Correct 6 ms 2284 KB Output is correct
16 Correct 2 ms 2028 KB Output is correct
17 Correct 9 ms 2668 KB Output is correct
18 Correct 3 ms 2156 KB Output is correct
19 Correct 2 ms 2028 KB Output is correct
20 Correct 3 ms 1900 KB Output is correct
21 Correct 2 ms 2028 KB Output is correct
22 Correct 3 ms 2156 KB Output is correct
23 Correct 6 ms 2156 KB Output is correct
24 Correct 10 ms 2540 KB Output is correct
25 Correct 4 ms 2284 KB Output is correct
26 Correct 4 ms 2156 KB Output is correct
27 Correct 5 ms 2156 KB Output is correct
28 Correct 20 ms 3052 KB Output is correct
29 Correct 61 ms 4968 KB Output is correct
30 Correct 14 ms 2668 KB Output is correct
31 Correct 31 ms 3560 KB Output is correct
32 Correct 23 ms 3052 KB Output is correct
33 Correct 139 ms 8164 KB Output is correct
34 Correct 94 ms 8164 KB Output is correct
35 Correct 109 ms 9832 KB Output is correct
36 Correct 10 ms 3180 KB Output is correct
37 Correct 124 ms 12768 KB Output is correct
38 Correct 110 ms 13156 KB Output is correct
39 Correct 96 ms 13028 KB Output is correct
40 Correct 104 ms 13032 KB Output is correct
41 Correct 148 ms 13540 KB Output is correct
42 Correct 8 ms 2412 KB Output is correct
43 Correct 9 ms 2412 KB Output is correct
44 Correct 7 ms 2156 KB Output is correct
45 Correct 958 ms 30044 KB Output is correct
46 Correct 687 ms 30044 KB Output is correct
47 Correct 766 ms 42328 KB Output is correct
48 Correct 145 ms 15976 KB Output is correct
49 Correct 75 ms 11236 KB Output is correct
50 Correct 64 ms 10592 KB Output is correct
51 Correct 312 ms 21212 KB Output is correct
52 Correct 365 ms 22620 KB Output is correct
53 Correct 50 ms 9444 KB Output is correct
54 Correct 11 ms 3308 KB Output is correct
55 Correct 19 ms 4608 KB Output is correct
56 Correct 25 ms 4972 KB Output is correct
57 Correct 259 ms 24032 KB Output is correct
58 Correct 43 ms 5356 KB Output is correct
59 Correct 50 ms 6892 KB Output is correct
60 Correct 66 ms 8428 KB Output is correct
61 Correct 60 ms 7780 KB Output is correct
62 Correct 914 ms 29864 KB Output is correct
63 Execution timed out 1055 ms 63844 KB Time limit exceeded
64 Halted 0 ms 0 KB -