oj.uz

Submission #380693

# Submission time Handle Problem Language Result Execution time Memory
380693 2021-03-22T19:48:50 Z AmineWeslati Sky Walking (IOI19_walk) C++14
10 / 100
 4000 ms 597644 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

#ifndef LOCAL
#include "walk.h"
#endif

int N,M; 
map<ll,vpi>adj[MX];
V<ll> X;

ll weight(ll u, ll h, ll v, ll hh){
	return abs(X[u]-X[v])+abs(h-hh);
}

ll min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int s, int g) {
	N=sz(x); M=sz(l);
	X.assign(all(x));

	vi vec[N]; 
	FOR(i,0,N) vec[i].pb(0);
	FOR(i,0,M){
		vi v;
		FOR(j,l[i],r[i]+1) if(h[j]>=y[i]) 
			v.pb(j),vec[j].pb(y[i]);
		FOR(j,1,sz(v)){
			adj[v[j]][y[i]].pb({v[j-1],y[i]});
			adj[v[j-1]][y[i]].pb({v[j],y[i]});
		}
	}

	FOR(i,0,N){
		sort(all(vec[i]));
		FOR(j,1,sz(vec[i])){
			adj[i][vec[i][j-1]].pb({i,vec[i][j]});
			adj[i][vec[i][j]].pb({i,vec[i][j-1]});
		}
	}

	priority_queue<pair<ll,pi>,V<pair<ll,pi>>,greater<pair<ll,pi>>>q;
	q.push({0,{s,0}});
	map<int,ll>dist[N];
	dist[s][0]=0;

	while(!q.empty()){
		pair<ll,pi>p=q.top(); q.pop();
		ll d=p.fi; int u=p.se.fi,t=p.se.se;
		if(d>dist[u][t]) continue;
		if(!adj[u].count(t)) continue;

		for(auto it: adj[u][t]){
			ll v=it.fi,tt=it.se;
			if(!dist[v].count(tt) || weight(u,t,v,tt)+d<dist[v][tt]){
				dist[v][tt]=weight(u,t,v,tt)+d;
				q.push({dist[v][tt],{v,tt}});
			}
			
		}
	}

	if(!dist[g].count(0)) return -1;
	return dist[g][0];
}	

#ifdef LOCAL
int main() {
    boost; IO();

    /*vi x={0,3,5,7,10,12,14},h={8,7,9,7,6,6,9};
    vi l={0,0,0,2,2,3,4},r={1,2,6,3,6,4,6};
    vi y={1,6,8,1,7,2,5};
    int s=1,g=5;

    cout << min_distance(x,h,l,r,y,s,g) << endl;*/

    /*vi x={0,4,5,6,9},h={6,6,6,6,6};
    vi l={3,1,0},r={4,3,2};
    vi y={1,3,6};
    int s=0,g=4;

    cout << min_distance(x,h,l,r,y,s,g) << endl;*/
    

    return 0;
}
#endif
//Change your approach

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9708 KB Output is correct
2 Correct 7 ms 9708 KB Output is correct
3 Correct 7 ms 9708 KB Output is correct
4 Correct 7 ms 9708 KB Output is correct
5 Correct 7 ms 9836 KB Output is correct
6 Correct 7 ms 9836 KB Output is correct
7 Correct 8 ms 9836 KB Output is correct
8 Correct 7 ms 9836 KB Output is correct
9 Correct 7 ms 9708 KB Output is correct
10 Correct 8 ms 9964 KB Output is correct
11 Correct 7 ms 9708 KB Output is correct
12 Correct 7 ms 9708 KB Output is correct
13 Correct 7 ms 9708 KB Output is correct
14 Correct 7 ms 9708 KB Output is correct
15 Correct 7 ms 9708 KB Output is correct
16 Correct 7 ms 9708 KB Output is correct
17 Correct 8 ms 9964 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9712 KB Output is correct
2 Correct 8 ms 9708 KB Output is correct
3 Correct 1998 ms 163932 KB Output is correct
4 Correct 1148 ms 189420 KB Output is correct
5 Correct 659 ms 124140 KB Output is correct
6 Correct 2056 ms 111596 KB Output is correct
7 Correct 608 ms 124140 KB Output is correct
8 Correct 2763 ms 208292 KB Output is correct
9 Correct 745 ms 126944 KB Output is correct
10 Correct 1687 ms 255840 KB Output is correct
11 Correct 684 ms 95980 KB Output is correct
12 Correct 321 ms 77932 KB Output is correct
13 Correct 1358 ms 226156 KB Output is correct
14 Execution timed out 4082 ms 30624 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 27756 KB Output is correct
2 Execution timed out 4115 ms 597644 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 27756 KB Output is correct
2 Execution timed out 4115 ms 597644 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9708 KB Output is correct
2 Correct 7 ms 9708 KB Output is correct
3 Correct 7 ms 9708 KB Output is correct
4 Correct 7 ms 9708 KB Output is correct
5 Correct 7 ms 9836 KB Output is correct
6 Correct 7 ms 9836 KB Output is correct
7 Correct 8 ms 9836 KB Output is correct
8 Correct 7 ms 9836 KB Output is correct
9 Correct 7 ms 9708 KB Output is correct
10 Correct 8 ms 9964 KB Output is correct
11 Correct 7 ms 9708 KB Output is correct
12 Correct 7 ms 9708 KB Output is correct
13 Correct 7 ms 9708 KB Output is correct
14 Correct 7 ms 9708 KB Output is correct
15 Correct 7 ms 9708 KB Output is correct
16 Correct 7 ms 9708 KB Output is correct
17 Correct 8 ms 9964 KB Output is correct
18 Correct 7 ms 9712 KB Output is correct
19 Correct 8 ms 9708 KB Output is correct
20 Correct 1998 ms 163932 KB Output is correct
21 Correct 1148 ms 189420 KB Output is correct
22 Correct 659 ms 124140 KB Output is correct
23 Correct 2056 ms 111596 KB Output is correct
24 Correct 608 ms 124140 KB Output is correct
25 Correct 2763 ms 208292 KB Output is correct
26 Correct 745 ms 126944 KB Output is correct
27 Correct 1687 ms 255840 KB Output is correct
28 Correct 684 ms 95980 KB Output is correct
29 Correct 321 ms 77932 KB Output is correct
30 Correct 1358 ms 226156 KB Output is correct
31 Execution timed out 4082 ms 30624 KB Time limit exceeded
32 Halted 0 ms 0 KB -