oj.uz

답안 #404596

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
404596 2021-05-14T17:25:26 Z arwaeystoamneg Jakarta Skyscrapers (APIO15_skyscraper) C++17
0 / 100
 2 ms 1032 KB 
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
const int MAX = 30000, SQ = 1;//200;
int n, m, dist[MAX][SQ + 1], ans[MAX];
vi a[MAX];
int st, en;
priority_queue<pair<int, pii>, vector<pair<int, pii>>, greater<pair<int, pii>>>todo;
void Do(int i)
{
	trav(x, a[i])
	{
		todo.push({ ans[i], {i,x} });
		if (x <= SQ)dist[i][x] = ans[i];
	}
}
int main()
{
	setIO("test1");
	cin >> n >> m;
	F0R(i, m)
	{
		int x, y;
		cin >> x >> y;
		if (i == 0)st = x;
		if (i == 1)en = y;
		a[x].pb(y);
	}
	F0R(i, n)F0R(j, SQ + 1)dist[i][j] = inf;
	fill(ans, ans + n, inf);
	ans[st] = 0;
	trav(x, a[st])
	{
		if (x <= SQ)
		{
			dist[st][x] = 0;
			todo.push({ 0,{st,x} });
		}
		else
		{
			todo.push({ 0,{st,x} });
		}
	}
	while (sz(todo))
	{
		pair<int, pii> temp = todo.top();
		todo.pop();
		int i = temp.s.f, x = temp.s.s;
		if (x <= SQ)
		{
			if (i - x >= 0)
			{
				if (dist[i - x][x] > dist[i][x] + 1)
				{
					dist[i - x][x] = dist[i][x] + 1;
					if (dist[i - x][x] < ans[i - x])
					{
						ans[i - x] = dist[i - x][x];
						Do(i - x);
					}
					todo.push({ ans[i - x],{i - x,x } });
				}
			}
			if (i + x <= n - 1)
			{
				if (dist[i + x][x] > dist[i][x] + 1)
				{
					dist[i + x][x] = dist[i][x] + 1;
					if (dist[i + x][x] < ans[i + x])
					{
						ans[i + 1] = dist[i + x][x];
						Do(i + x);
					}
					todo.push({ ans[i + x], {i + x,x} });
				}
			}
		}
		else
		{
			if (i - x >= 0)
			{
				if (ans[i - x] > ans[i] + 1)
				{
					ans[i - x] = ans[i] + 1;
					todo.push({ ans[i - x],{i-x,x} });
					Do(i - x);
				}
			}
			if (i + x <= n - 1)
			{
				if (ans[i + x] > ans[i] + 1)
				{
					ans[i + x] = ans[i] + 1;
					todo.push({ ans[i + x],{i + x,x} });
					Do(i + x);
				}
			}
		}
	}
	cout << ans[en] << endl;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Incorrect 1 ms 972 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 1028 KB Output is correct
3 Incorrect 1 ms 1032 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Incorrect 1 ms 972 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 2 ms 972 KB Output is correct
3 Incorrect 1 ms 972 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Incorrect 1 ms 972 KB Output isn't correct
4 Halted 0 ms 0 KB -