oj.uz

Submission #882503

# Submission time Handle Problem Language Result Execution time Memory
882503 2023-12-03T09:18:43 Z vjudge1 Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 86 ms 2956 KB 
#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& in, pair<X,Y> &pr) {return in>>pr.first>>pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X> istream& operator>>(istream& in, vector<X> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X> ostream& operator<<(ostream& os, vector<X> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename X, size_t Y> istream& operator>>(istream& in, array<X,Y> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> arr) {for(auto &it : arr) os<<it<<" "; return os;}
#define int long long
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
int32_t main(){
	ios;
	int t=1;
	int tno = 0;
	if (!t) cin>>t;
	while (t-(tno++)){
		deci(n);deci(m);
		vector<vector<int>> arr(n);
		int bas = -1;
		int son = -1;
		for (int i = 0; i < m; i++){
			deci(x);deci(p);
			if (i==0) bas = x;
			if (i==1) son = x;
			arr[x].push_back(p);
		}
		for (int i = 0; i < n; ++i)
		{
			sortarr(arr[i]);
		}
		vector<int> sp(n,-1);
		queue<array<int,4>> q;//nerde, kacla yuruo, time, nereye gidio
		sp[bas]=0;
		for (int i = 0; i < arr[bas].size(); ++i)
		{
			if (i && arr[bas][i]==arr[bas][i-1]) continue;
			if (bas-arr[bas][i]>=0){
				q.push({bas-arr[bas][i],arr[bas][i],1,0});
			}
			if (bas+arr[bas][i]<n){
				q.push({bas+arr[bas][i],arr[bas][i],1,1});
			}
		}
		while (q.size()){
			int node = q.front()[0];
			int step = q.front()[1];
			int tim = q.front()[2];
			int wh = q.front()[3];
			q.pop();
			if (sp[node]==-1){
				sp[node]=tim;
				if (node==son) break;
				for (int i = 0; i < arr[node].size(); i++){
					if (i && arr[node][i]==arr[node][i-1]) continue;
					if (arr[node][i]==step) continue;//optimize etcez
					if (node-arr[node][i]>=0){
						q.push({node-arr[node][i],arr[node][i],tim+1,0});
					}
					if (node+arr[node][i]<n){
						q.push({node+arr[node][i],arr[node][i],tim+1,1});
					}
				}
			}
			if (wh==0){
				if (node-step>=0) q.push({node-step,step,tim+1,wh});
			}
			else {
				if (node+step<n) q.push({node+step,step,tim+1,wh});
			}
		}
		cout<<sp[son]<<endl;
	}
}

Compilation message

skyscraper.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
skyscraper.cpp: In function 'int32_t main()':
skyscraper.cpp:59:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |   for (int i = 0; i < arr[bas].size(); ++i)
      |                   ~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:78:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for (int i = 0; i < arr[node].size(); i++){
      |                     ~~^~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 4 ms 1168 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 4 ms 1372 KB Output is correct
38 Correct 5 ms 1368 KB Output is correct
39 Correct 5 ms 820 KB Output is correct
40 Correct 5 ms 856 KB Output is correct
41 Correct 5 ms 1116 KB Output is correct
42 Correct 3 ms 788 KB Output is correct
43 Correct 3 ms 860 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 10 ms 1628 KB Output is correct
46 Correct 7 ms 1884 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 424 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 5 ms 1372 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 4 ms 1372 KB Output is correct
38 Correct 7 ms 1268 KB Output is correct
39 Correct 5 ms 856 KB Output is correct
40 Correct 5 ms 860 KB Output is correct
41 Correct 5 ms 1116 KB Output is correct
42 Correct 3 ms 860 KB Output is correct
43 Correct 4 ms 860 KB Output is correct
44 Correct 3 ms 856 KB Output is correct
45 Correct 9 ms 1628 KB Output is correct
46 Correct 9 ms 1748 KB Output is correct
47 Correct 5 ms 1372 KB Output is correct
48 Correct 6 ms 1628 KB Output is correct
49 Correct 5 ms 1628 KB Output is correct
50 Correct 4 ms 1628 KB Output is correct
51 Correct 9 ms 2196 KB Output is correct
52 Correct 10 ms 2396 KB Output is correct
53 Correct 7 ms 1884 KB Output is correct
54 Correct 1 ms 1372 KB Output is correct
55 Correct 1 ms 1372 KB Output is correct
56 Correct 6 ms 2140 KB Output is correct
57 Correct 1 ms 1372 KB Output is correct
58 Correct 4 ms 1760 KB Output is correct
59 Correct 5 ms 2016 KB Output is correct
60 Correct 5 ms 1760 KB Output is correct
61 Correct 5 ms 1796 KB Output is correct
62 Correct 12 ms 2648 KB Output is correct
63 Correct 30 ms 2652 KB Output is correct
64 Correct 39 ms 2588 KB Output is correct
65 Correct 48 ms 2820 KB Output is correct
66 Correct 86 ms 2956 KB Output is correct
67 Correct 45 ms 2908 KB Output is correct