oj.uz

답안 #781479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781479 2023-07-13T06:52:49 Z OrazB 고대 책들 (IOI17_books) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
#define pv pair<pii, vector<int>>

ll mn = 1e9;
map <pv, int> mp;

// void rec(int s, int x, vector<int> p, int c){
// 	if (s < 0 or s >= p.size() or mp[{{s, x}, p}]){
// 		// mp[{{s, x}, p}] = min(mp[{{s, x}, p}], c);
// 		return;
// 	}
// 	mp[{{s, x}, p}] = c+1;
// 	rec(s+1, x, p, c+1);
// 	rec(s-1, x, p, c+1);
// 	swap(p[s], x);
// 	rec(s, x, p, c);
// 	swap(p[s], x);
// }

ll minimum_walk(vector<int> p, int s){
	int n = p.size(), pos = 0;
	ll ans = 0;
	for (int i = 0; i < n; i++){
		if (p[i] == i) continue;
		int cur = p[i];
		while(cur != i){
			ans += abs(pos-cur);
			pos = cur;
			swap(cur, p[cur]);
		}
	}
	ans += abs(pos-s);
	return ans;
}	


// int main ()
// {
// 	ios::sync_with_stdio(false);
// 	cin.tie(0);
// 	int n, s;
// 	cin >> n >> s;
// 	vector<int> p(n);
// 	for (int i = 0; i < n; i++) cin >> p[i];
// 	cout << minimum_walk(p, s);
// }

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '8', found: '6'
7 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '8', found: '6'
7 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '8', found: '6'
7 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3701'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '8', found: '6'
7 Halted 0 ms 0 KB -