oj.uz

답안 #436867

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
436867 2021-06-25T07:01:44 Z Karliver Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 52 ms 12112 KB 
 
	
#include <bits/stdc++.h>

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
using ll = long long;
int mod = (ll)1e9 + 7;
#define PI acos(-1)
typedef pair<int, int> pairs;

const int INF = 1e9 + 1;
const int N = 2e5 + 100;
const double eps = 1e-7;

template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  

template <typename XPAX>
void ckma(XPAX &x, XPAX y) {
    x = (x < y ? y : x);
}
template <typename XPAX>
void ckmi(XPAX &x, XPAX y) {
    x = (x > y ? y : x);
}
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
void solve() {


	int n, m;
	cin >> n >> m;

	V<set<int>> s(n);
	VV<pairs> g(n);
	V<int> f(m), p(m);
	
	V<int> vis(n, false);

	forn(i, m) {
		cin >> f[i] >> p[i];

		s[f[i]].insert(p[i]);
		
	}


	int x;
	for(int i = 0;i < n;++i) {
		for(auto c : s[i]) {
			x = i - c;
			while(x >= 0) {
				if(s[x].size())g[i].push_back({(i - x) / c, x});
				if(s[x].count(c))break;
				x -= c;
			}

			x = i + c;
			while(x < n) {
				if(s[x].size())g[i].push_back({(x - i) / c, x});
				if(s[x].count(c))break;
				x += c;
			}
		}
	}



	

	priority_queue<pairs, V<pairs>, greater<pairs>> q;

	q.push({0, f[0]});
	
	

	//debug(dis);
	while(q.size()) {
		x = q.top().second;
		int s = q.top().first;
		q.pop();

		if(vis[x])continue;
		vis[x] = 1;
		if(x == f[1]) {
			cout << s << '\n';
			exit(0);
		}
		for(auto c : g[x]) {
			if(!vis[c.second])q.push({s + c.first, c.second});
		}
	}


	cout << -1 << '\n';






}
void test_case() {
    int t;
    cin >> t;
    forn(p, t) {

        //cout << "Case #" << p + 1 << ": ";
        solve();
    }
}
int main() {

    ios::sync_with_stdio(false);
    cin.tie(0);

    solve();

}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 3 ms 716 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 3 ms 588 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 3 ms 716 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 2 ms 564 KB Output is correct
34 Correct 2 ms 588 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 2 ms 588 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 3 ms 716 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 2 ms 588 KB Output is correct
34 Correct 2 ms 588 KB Output is correct
35 Correct 24 ms 3392 KB Output is correct
36 Correct 3 ms 844 KB Output is correct
37 Correct 20 ms 4520 KB Output is correct
38 Correct 33 ms 4296 KB Output is correct
39 Correct 22 ms 3684 KB Output is correct
40 Correct 26 ms 3744 KB Output is correct
41 Correct 22 ms 3984 KB Output is correct
42 Correct 6 ms 588 KB Output is correct
43 Correct 6 ms 716 KB Output is correct
44 Correct 6 ms 844 KB Output is correct
45 Correct 21 ms 2764 KB Output is correct
46 Correct 20 ms 2796 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 3 ms 716 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 4 ms 588 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 2 ms 716 KB Output is correct
29 Correct 2 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 2 ms 716 KB Output is correct
34 Correct 2 ms 588 KB Output is correct
35 Correct 19 ms 3440 KB Output is correct
36 Correct 3 ms 844 KB Output is correct
37 Correct 21 ms 4544 KB Output is correct
38 Correct 23 ms 4424 KB Output is correct
39 Correct 23 ms 3680 KB Output is correct
40 Correct 23 ms 3784 KB Output is correct
41 Correct 23 ms 3960 KB Output is correct
42 Correct 6 ms 588 KB Output is correct
43 Correct 6 ms 716 KB Output is correct
44 Correct 6 ms 832 KB Output is correct
45 Correct 20 ms 2760 KB Output is correct
46 Correct 20 ms 2768 KB Output is correct
47 Correct 46 ms 12112 KB Output is correct
48 Correct 18 ms 4800 KB Output is correct
49 Correct 17 ms 4208 KB Output is correct
50 Correct 12 ms 3820 KB Output is correct
51 Correct 36 ms 7432 KB Output is correct
52 Correct 48 ms 7812 KB Output is correct
53 Correct 15 ms 4892 KB Output is correct
54 Correct 4 ms 2508 KB Output is correct
55 Correct 2 ms 2508 KB Output is correct
56 Correct 15 ms 5068 KB Output is correct
57 Correct 8 ms 3276 KB Output is correct
58 Correct 8 ms 2892 KB Output is correct
59 Correct 8 ms 3032 KB Output is correct
60 Correct 10 ms 3020 KB Output is correct
61 Correct 9 ms 3192 KB Output is correct
62 Correct 29 ms 9584 KB Output is correct
63 Correct 26 ms 4552 KB Output is correct
64 Correct 30 ms 4556 KB Output is correct
65 Correct 39 ms 4628 KB Output is correct
66 Correct 52 ms 5028 KB Output is correct
67 Correct 50 ms 5044 KB Output is correct