oj.uz

답안 #1073967

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073967 2024-08-25T05:38:33 Z GrindMachine Text editor (CEOI24_editor) C++17
56 / 100
 2219 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define conts continue
#define sz(a) (int)a.size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &x, T y){
	x = min(x,y);
}

template<typename T>
void amax(T &x, T y){
	x = max(x,y);
}

template<typename A,typename B>
string to_string(pair<A,B> p);

string to_string(const string &s){
	return "'"+s+"'";
}

string to_string(const char* s){
	return to_string((string)s);
}

string to_string(bool b){
	return b?"true":"false";
}

template<typename A>
string to_string(A v){
	string res = "{";
	trav(x,v){
		res += to_string(x)+",";
	}
	if(res.back() == ',') res.pop_back();
	res += "}";
	return res;
}

template<typename A,typename B>
string to_string(pair<A,B> p){
	return "("+to_string(p.ff)+","+to_string(p.ss)+")";
}

#define debug(x) cout << "[" << #x << "]: "; cout << to_string(x) << endl

const int MOD = 1e9 + 7;
const int N = 1e3 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = (ll)1e18 + 5;

void solve(int test_case){
	ll n; cin >> n;
	ll si,sj,ei,ej; cin >> si >> sj >> ei >> ej;
	vector<ll> a(n+5);
	rep1(i,n) cin >> a[i];

	vector<ll> b;
	rep1(i,n) b.pb(a[i]+1);
	b.pb(sj), b.pb(ej);
	b.pb(1);
	b.pb(-1);
	sort(all(b));
	b.resize(unique(all(b))-b.begin());

	ll m = sz(b)-1;
	vector<ll> ind(n+5);

	vector<array<ll,3>> adj[n+5][m+5];

	// left/right
	rep1(i,n){
		// within row
		ll pos = 1;
		for(int j = 2; j <= m; ++j){
			if(b[j] > a[i]+1) break;
			pos = j;
			ll w = b[j]-b[j-1];
			adj[i][j-1].pb({i,j,w});
			adj[i][j].pb({i,j-1,w});
		}

		ind[i] = pos;

		// across row
		if(i+1 <= n){
			ll j = ind[i];
			adj[i][j].pb({i+1,1,1});
			adj[i+1][1].pb({i,j,1});
		}
	}

	// up/down
	rep1(i,n){
		rep1(j,ind[i]){
			// go up
			if(i-1 >= 1){
				ll j2 = min((ll)j,ind[i-1]);
				adj[i][j].pb({i-1,j2,1});
			}

			// go down
			if(i+1 <= n){
				ll j2 = min((ll)j,ind[i+1]);
				adj[i][j].pb({i+1,j2,1});
			}
		}
	}

	sj = lower_bound(all(b),sj)-b.begin();
	ej = lower_bound(all(b),ej)-b.begin();

	priority_queue<array<ll,3>,vector<array<ll,3>>,greater<array<ll,3>>> pq;
	bool vis[n+5][m+5];
	memset(vis,0,sizeof vis);

	auto ins = [&](ll i, ll j, ll cost){
		pq.push({cost,i,j});
	};

	ins(si,sj,0);

	while(!pq.empty()){
		auto [cost,i,j] = pq.top();
		pq.pop();

		if(vis[i][j]) conts;
		vis[i][j] = 1;

		if(i == ei and j == ej){
			cout << cost << endl;
			return;
		}

		for(auto [i2,j2,w] : adj[i][j]){
			ins(i2,j2,cost+w);
		}
	}

	assert(0);
}

int main(){
	fastio;

	int t = 1;
	// cin >> t;

	rep1(i,t){
		solve(i);
	}

	return 0;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 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 344 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

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 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 2 ms 1116 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 2 ms 1116 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 215 ms 37376 KB Output is correct
10 Correct 188 ms 38480 KB Output is correct
11 Correct 191 ms 37968 KB Output is correct
12 Correct 328 ms 65044 KB Output is correct
13 Correct 367 ms 66600 KB Output is correct
14 Correct 113 ms 67856 KB Output is correct
15 Correct 85 ms 73808 KB Output is correct
16 Correct 96 ms 73128 KB Output is correct
17 Correct 276 ms 72856 KB Output is correct
18 Correct 329 ms 78404 KB Output is correct
19 Correct 340 ms 78264 KB Output is correct
20 Correct 53 ms 15552 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 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 348 KB Output is correct
7 Correct 0 ms 344 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 2 ms 1116 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 215 ms 37376 KB Output is correct
17 Correct 188 ms 38480 KB Output is correct
18 Correct 191 ms 37968 KB Output is correct
19 Correct 328 ms 65044 KB Output is correct
20 Correct 367 ms 66600 KB Output is correct
21 Correct 113 ms 67856 KB Output is correct
22 Correct 85 ms 73808 KB Output is correct
23 Correct 96 ms 73128 KB Output is correct
24 Correct 276 ms 72856 KB Output is correct
25 Correct 329 ms 78404 KB Output is correct
26 Correct 340 ms 78264 KB Output is correct
27 Correct 53 ms 15552 KB Output is correct
28 Correct 2 ms 1116 KB Output is correct
29 Correct 3 ms 1372 KB Output is correct
30 Correct 3 ms 1044 KB Output is correct
31 Correct 2 ms 1116 KB Output is correct
32 Correct 2 ms 860 KB Output is correct
33 Correct 231 ms 50564 KB Output is correct
34 Correct 258 ms 56912 KB Output is correct
35 Correct 272 ms 58492 KB Output is correct
36 Correct 346 ms 81092 KB Output is correct
37 Correct 112 ms 81208 KB Output is correct
38 Correct 106 ms 81020 KB Output is correct
39 Correct 286 ms 81136 KB Output is correct
40 Correct 153 ms 81036 KB Output is correct
41 Correct 184 ms 81020 KB Output is correct
42 Correct 296 ms 104876 KB Output is correct
43 Correct 304 ms 104876 KB Output is correct
44 Correct 56 ms 19020 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 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 344 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 2 ms 1116 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 3 ms 1372 KB Output is correct
16 Correct 3 ms 1044 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 2 ms 860 KB Output is correct
19 Correct 1982 ms 704072 KB Output is correct
20 Correct 2219 ms 722776 KB Output is correct
21 Correct 1938 ms 741208 KB Output is correct
22 Correct 2050 ms 794816 KB Output is correct
23 Correct 1725 ms 614468 KB Output is correct

Subtask #5
0.0 / 44.0

# 결과 실행 시간 메모리 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 348 KB Output is correct
7 Correct 0 ms 344 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 2 ms 1116 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 215 ms 37376 KB Output is correct
17 Correct 188 ms 38480 KB Output is correct
18 Correct 191 ms 37968 KB Output is correct
19 Correct 328 ms 65044 KB Output is correct
20 Correct 367 ms 66600 KB Output is correct
21 Correct 113 ms 67856 KB Output is correct
22 Correct 85 ms 73808 KB Output is correct
23 Correct 96 ms 73128 KB Output is correct
24 Correct 276 ms 72856 KB Output is correct
25 Correct 329 ms 78404 KB Output is correct
26 Correct 340 ms 78264 KB Output is correct
27 Correct 53 ms 15552 KB Output is correct
28 Correct 2 ms 1116 KB Output is correct
29 Correct 3 ms 1372 KB Output is correct
30 Correct 3 ms 1044 KB Output is correct
31 Correct 2 ms 1116 KB Output is correct
32 Correct 2 ms 860 KB Output is correct
33 Correct 231 ms 50564 KB Output is correct
34 Correct 258 ms 56912 KB Output is correct
35 Correct 272 ms 58492 KB Output is correct
36 Correct 346 ms 81092 KB Output is correct
37 Correct 112 ms 81208 KB Output is correct
38 Correct 106 ms 81020 KB Output is correct
39 Correct 286 ms 81136 KB Output is correct
40 Correct 153 ms 81036 KB Output is correct
41 Correct 184 ms 81020 KB Output is correct
42 Correct 296 ms 104876 KB Output is correct
43 Correct 304 ms 104876 KB Output is correct
44 Correct 56 ms 19020 KB Output is correct
45 Correct 1982 ms 704072 KB Output is correct
46 Correct 2219 ms 722776 KB Output is correct
47 Correct 1938 ms 741208 KB Output is correct
48 Correct 2050 ms 794816 KB Output is correct
49 Correct 1725 ms 614468 KB Output is correct
50 Runtime error 594 ms 1048576 KB Execution killed with signal 9
51 Halted 0 ms 0 KB -