oj.uz

Submission #960807

# Submission time Handle Problem Language Result Execution time Memory
960807 2024-04-11T04:38:58 Z _rain_ Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 186 ms 54100 KB 
/** author : _RAIN_ **/
#include<bits/stdc++.h>
using namespace std;

using i64 = long long;
using ui64 = unsigned long long;

#define MASK(x) ((i64)(1) << (x))
#define BIT(mask , x) (((mask) >> (x)) & (1))

template<class T>
	bool maximize(T &a , T b) {if (a < b) return a = b , true; else return false;}
template<class T>
	bool minimize(T &a , T b) {if (a > b) return a = b , true; else return false;}
template<class T>
	T gcd(T x , T y) {while (y) swap(y , x %= y); return x;}
template<class T>
	T lcm(T x , T y) {return (x * y) / gcd(x , y);}

const int maxn = 3e4;
int b[maxn + 2] , p[maxn + 2] , idx[maxn + 2];
int n , numperson;

namespace subtask1
{
	bool check()
	{
		return n <= (int)2e3 && numperson <= (int)2e3;
	}
	const int N = (int)2e3;
	int cost[N + 2][N + 2];
	int d[N + 2] ;
	vector<int> g[N + 2];
	void main_code(void)
	{
		memset(cost , 0x3f , sizeof cost);
		memset(d , 0x3f , sizeof d);
		for (int i = 1; i <= numperson; ++i)
		{
			for (int j = 1; j <= numperson; ++j)
			{
				if (b[i] != b[j])
				{
					int dist = abs(b[i] - b[j]);
					if (dist % p[i] == 0) 
						{
							g[b[i]].emplace_back(b[j]);
							minimize(cost[b[i]][b[j]] , dist / p[i]);
						}
					if (dist % p[j] == 0)
						{
							g[b[j]].emplace_back(b[i]);
							minimize(cost[b[j]][b[i]] , dist / p[j]);
						}
				}
			}
			
		}
		priority_queue<pair<i64 ,int> , vector<pair<i64 , int>> , greater<pair<i64 , int>>> q;
			d[b[1]] = 0;
			q.emplace(d[b[1]] , b[1]);
			while (q.size())
			{
				int u = q.top().second;
				int val = q.top().first; q.pop();
				if (val != d[u]) continue;
				for (int& v : g[u])
				{
					if (minimize(d[v] , d[u] + cost[u][v]))
						q.emplace(d[v] , v);
				}
			}
			cout << (d[b[2]] == d[n + 1] ? -1 : d[b[2]]);
	}
}
namespace subtask2
{
	bool check(void)
	{
		return true;
	}
	const int N = (int)2e3;
	vector<int> g[N + 2];
	vector<int> divisor[N + 2];
	int cost[N + 2][N + 2];
	bool ok[N + 2][N + 2];
	int d[N + 2];
	void prepare(void)
	{
		for (int i = 1; i <= numperson; ++i)
			ok[b[i]][p[i]] = true;

		for (int i = 1; i <= trunc(sqrt(N)); ++i)
		{
			divisor[i * i].emplace_back(i);
			for (int j = i + 1; j <= N / i; ++j)
			{
				divisor[i * j].emplace_back(i);
				divisor[i * j].emplace_back(j);
			}
		}
		for (int i = 1; i <= N; ++i) sort(divisor[i].begin() , divisor[i].end());
		return;
	}

	void main_code(void)
	{
		prepare();
		memset(cost , 0x3f , sizeof cost);
		for (int i = 0; i < n; ++i)
		{
			for (int j = 0; j < n; ++j)
			{
				if (i != j) 
					{
						int dist = abs(i - j);
						for (auto& v : divisor[dist])
						{
							if (ok[i][v])
							{
								g[i].emplace_back(j);
								cost[i][j] = dist / v;
								break;
							}
						}
						for (auto& v : divisor[dist])
						{
							if (ok[j][v])
							{
								g[j].emplace_back(i);
								cost[j][i] = dist / v;
								break;
							}
						}
					}
			}
		}
		memset(d , 0x3f , sizeof d);
		priority_queue<pair<i64 ,int> , vector<pair<i64 , int>> , greater<pair<i64 , int>>> q;
			d[b[1]] = 0;
			q.emplace(d[b[1]] , b[1]);
			while (q.size())
			{
				int u = q.top().second;
				int val = q.top().first; q.pop();
				if (val != d[u]) continue;
				for (int& v : g[u])
				{
					if (minimize(d[v] , d[u] + cost[u][v]))
						q.emplace(d[v] , v);
				}
			}
			cout << (d[b[2]] == d[n + 1] ? -1 : d[b[2]]);
	}
}

int32_t main(void)
{
	cin.tie(nullptr)->sync_with_stdio(false);
	const string name = "main";
	if (fopen((name + ".inp").c_str() , "r"))
	{
		(void)!freopen((name + ".inp").c_str() , "r" , stdin);
		(void)!freopen((name + ".out").c_str() , "w+", stdout);
	}
	cin >> n >> numperson;
	for (int i = 1; i <= numperson; ++i) 
		cin >> b[i] >> p[i];
	if (subtask1::check())
		return subtask1::main_code() , 0;
	if (subtask2::check())
		return subtask2::main_code() , 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17244 KB Output is correct
2 Correct 3 ms 17244 KB Output is correct
3 Correct 3 ms 17244 KB Output is correct
4 Correct 3 ms 17244 KB Output is correct
5 Correct 3 ms 17244 KB Output is correct
6 Correct 3 ms 17244 KB Output is correct
7 Correct 3 ms 17244 KB Output is correct
8 Correct 3 ms 17244 KB Output is correct
9 Correct 3 ms 17244 KB Output is correct
10 Correct 4 ms 17240 KB Output is correct
11 Correct 42 ms 18952 KB Output is correct
12 Correct 7 ms 17620 KB Output is correct
13 Correct 14 ms 20944 KB Output is correct
14 Correct 38 ms 17648 KB Output is correct
15 Correct 38 ms 17616 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17240 KB Output is correct
2 Correct 3 ms 17244 KB Output is correct
3 Correct 3 ms 17244 KB Output is correct
4 Correct 3 ms 17240 KB Output is correct
5 Correct 3 ms 17244 KB Output is correct
6 Correct 3 ms 17244 KB Output is correct
7 Correct 3 ms 17244 KB Output is correct
8 Correct 3 ms 17244 KB Output is correct
9 Correct 3 ms 17244 KB Output is correct
10 Correct 4 ms 17364 KB Output is correct
11 Correct 42 ms 19084 KB Output is correct
12 Correct 6 ms 17660 KB Output is correct
13 Correct 15 ms 20688 KB Output is correct
14 Correct 38 ms 17500 KB Output is correct
15 Correct 38 ms 17744 KB Output is correct
16 Correct 10 ms 17500 KB Output is correct
17 Correct 35 ms 17904 KB Output is correct
18 Correct 12 ms 17244 KB Output is correct
19 Correct 6 ms 17064 KB Output is correct
20 Correct 173 ms 49492 KB Output is correct
21 Correct 15 ms 17244 KB Output is correct
22 Correct 8 ms 17244 KB Output is correct
23 Correct 11 ms 17112 KB Output is correct
24 Correct 35 ms 17492 KB Output is correct
25 Correct 38 ms 17376 KB Output is correct
26 Correct 19 ms 23128 KB Output is correct
27 Correct 14 ms 19412 KB Output is correct
28 Correct 39 ms 17532 KB Output is correct
29 Correct 8 ms 17368 KB Output is correct
30 Correct 3 ms 17240 KB Output is correct
31 Correct 6 ms 17244 KB Output is correct
32 Correct 5 ms 17244 KB Output is correct
33 Correct 38 ms 17708 KB Output is correct
34 Correct 38 ms 17684 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17244 KB Output is correct
2 Correct 3 ms 17244 KB Output is correct
3 Correct 3 ms 17244 KB Output is correct
4 Correct 3 ms 17240 KB Output is correct
5 Correct 3 ms 17244 KB Output is correct
6 Correct 3 ms 17244 KB Output is correct
7 Correct 3 ms 17124 KB Output is correct
8 Correct 3 ms 17244 KB Output is correct
9 Correct 3 ms 17108 KB Output is correct
10 Correct 4 ms 17240 KB Output is correct
11 Correct 42 ms 19096 KB Output is correct
12 Correct 6 ms 17660 KB Output is correct
13 Correct 14 ms 20596 KB Output is correct
14 Correct 38 ms 17688 KB Output is correct
15 Correct 38 ms 17524 KB Output is correct
16 Correct 10 ms 17492 KB Output is correct
17 Correct 33 ms 17924 KB Output is correct
18 Correct 12 ms 17116 KB Output is correct
19 Correct 6 ms 17140 KB Output is correct
20 Correct 186 ms 49748 KB Output is correct
21 Correct 15 ms 17328 KB Output is correct
22 Correct 8 ms 17264 KB Output is correct
23 Correct 11 ms 17244 KB Output is correct
24 Correct 35 ms 17404 KB Output is correct
25 Correct 39 ms 17240 KB Output is correct
26 Correct 18 ms 22040 KB Output is correct
27 Correct 14 ms 19480 KB Output is correct
28 Correct 40 ms 17472 KB Output is correct
29 Correct 8 ms 17244 KB Output is correct
30 Correct 3 ms 17244 KB Output is correct
31 Correct 6 ms 17244 KB Output is correct
32 Correct 6 ms 17244 KB Output is correct
33 Correct 38 ms 17712 KB Output is correct
34 Correct 38 ms 17696 KB Output is correct
35 Correct 54 ms 23124 KB Output is correct
36 Correct 27 ms 21584 KB Output is correct
37 Correct 100 ms 24884 KB Output is correct
38 Correct 102 ms 24172 KB Output is correct
39 Correct 104 ms 24408 KB Output is correct
40 Correct 126 ms 24312 KB Output is correct
41 Correct 104 ms 24308 KB Output is correct
42 Correct 82 ms 21596 KB Output is correct
43 Correct 86 ms 21640 KB Output is correct
44 Correct 125 ms 54088 KB Output is correct
45 Correct 90 ms 24624 KB Output is correct
46 Incorrect 96 ms 24552 KB Output isn't correct
47 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17240 KB Output is correct
2 Correct 3 ms 17252 KB Output is correct
3 Correct 3 ms 17244 KB Output is correct
4 Correct 3 ms 17244 KB Output is correct
5 Correct 3 ms 17116 KB Output is correct
6 Correct 3 ms 17244 KB Output is correct
7 Correct 3 ms 17244 KB Output is correct
8 Correct 3 ms 17244 KB Output is correct
9 Correct 3 ms 17244 KB Output is correct
10 Correct 4 ms 17240 KB Output is correct
11 Correct 42 ms 18964 KB Output is correct
12 Correct 6 ms 17656 KB Output is correct
13 Correct 14 ms 20840 KB Output is correct
14 Correct 38 ms 17988 KB Output is correct
15 Correct 38 ms 17744 KB Output is correct
16 Correct 10 ms 17500 KB Output is correct
17 Correct 33 ms 17716 KB Output is correct
18 Correct 12 ms 17496 KB Output is correct
19 Correct 6 ms 17244 KB Output is correct
20 Correct 179 ms 49680 KB Output is correct
21 Correct 15 ms 17240 KB Output is correct
22 Correct 8 ms 17308 KB Output is correct
23 Correct 12 ms 17348 KB Output is correct
24 Correct 35 ms 17328 KB Output is correct
25 Correct 39 ms 17244 KB Output is correct
26 Correct 19 ms 21472 KB Output is correct
27 Correct 14 ms 19416 KB Output is correct
28 Correct 40 ms 17492 KB Output is correct
29 Correct 8 ms 17244 KB Output is correct
30 Correct 3 ms 17240 KB Output is correct
31 Correct 6 ms 17244 KB Output is correct
32 Correct 5 ms 17240 KB Output is correct
33 Correct 38 ms 17604 KB Output is correct
34 Correct 38 ms 17648 KB Output is correct
35 Correct 55 ms 23096 KB Output is correct
36 Correct 24 ms 21592 KB Output is correct
37 Correct 101 ms 24700 KB Output is correct
38 Correct 101 ms 24248 KB Output is correct
39 Correct 114 ms 24512 KB Output is correct
40 Correct 109 ms 24540 KB Output is correct
41 Correct 103 ms 24148 KB Output is correct
42 Correct 81 ms 21676 KB Output is correct
43 Correct 83 ms 21648 KB Output is correct
44 Correct 113 ms 54100 KB Output is correct
45 Correct 90 ms 24528 KB Output is correct
46 Incorrect 90 ms 24484 KB Output isn't correct
47 Halted 0 ms 0 KB -