oj.uz

답안 #971735

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971735 2024-04-29T08:23:09 Z vjudge1 Bitaro's travel (JOI23_travel) C++17
15 / 100
 88 ms 19004 KB 
#include <time.h>
#include <cstdlib>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <map>
#include <set>
#include <iterator>
#include <deque>
#include <queue>
#include <sstream>
#include <array>
#include <string>
#include <tuple>
#include <chrono>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <list>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <bitset>
#define ll long long
using namespace std;

int tt = 1, n;
ll a[200005], dist, x[200005];
set<pair<ll, int>> st;
bool ok = 0;
ll pref[200005], suff[200005];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        st.insert({a[i], i});
        if(i > 1 && a[i] - a[i - 1] > 100) ok = 1;
    }
    cin >> tt;
    if(!ok){
        for(int i = 2; i <= n; i++)
            pref[i] = pref[i - 1] + (a[i] - a[i - 1]);
        for(int i = n - 1; i >= 1; i--)
            suff[i] = suff[i + 1] + (a[i + 1] - a[i]);
        while(tt--){
            ll pos, p1, p2, sum = 0;
            cin >> pos;
            deque<pair<ll, int>> d1, d2;
            if(st.begin()->first <= pos){
                auto it = st.upper_bound({pos + 1, 0});
                it--;
                p1 = it->second;
                for(int i = p1; i >= 1; i--)
                    if(pos - a[i] <= 100) d1.push_front({a[i], i});    
            }
            if(st.rbegin()->first > pos){
                auto it = st.upper_bound({pos + 1, 0});
                p2 = it->second;
                for(int i = p2; i <= n; i++)
                    if(a[i] - pos <= 100) d2.push_back({a[i], i});
            }
            if(d1.empty() && d2.empty()){
                if(pos < a[1]) cout << pref[n] + a[1] - pos << "\n";
                else cout << suff[1] + pos - a[n] << "\n";
                continue;
            }
            if(d1.empty()){
                sum = abs(d2.front().first - pos);
                sum += suff[d2.front().second];
                if(a[1] < pos) sum += pref[n];
                cout << sum << "\n";
                continue;
            }
            if(d2.empty()){
                sum = abs(d1.back().first - pos);
                sum += pref[d1.back().second];
                if(a[n] > pos) sum += pref[n];
                cout << sum << "\n";
                continue;
            }
            int pos1 = d1.back().second - 1, pos2 = d2.front().second + 1;
            while(!d1.empty() && !d2.empty()){
                ll num1 = abs(pos - d1.back().first), num2 = abs(pos - d2.front().first);
                if(num1 <= num2){
                    pos = d1.back().first;
                    d1.pop_back();  
                    sum += num1;
                    continue;
                }
                else{
                    pos = d2.front().first;
                    d2.pop_front();
                    sum += num2;
                    continue;
                }
            }
            if(d1.empty()){
                sum += abs(d2.front().first - pos);
                sum += suff[d2.front().second];
                if(pos1 != 0)
                    sum += pref[n];
                cout << sum << "\n";
                continue;
            }
            if(d2.empty()){
                sum += abs(d1.back().first - pos);
                sum += pref[d1.back().second];
                if(pos2 <= n)
                    sum += pref[n];
                cout << sum << "\n";
                continue;
            }
        }
        return 0; 
    }
    for(int i = 1; i <= tt; i++){
        cin >> x[i];
        ll sum = 0, pos = x[i];
        while(!st.empty()){
            ll x1 = 1e10, y1 = 1e10;
            pair<ll, int> p1, p2;
            if(st.begin()->first <= pos){
                auto it = st.lower_bound({pos, 0});
                it--;
                x1 = pos - it->first;
                p1 = *it;
            }
            if(st.rbegin()->first > pos){
                auto it = st.upper_bound({pos, 0});
                y1 = it->first - pos;
                p2 = *it;
            }
            if(x1 <= y1){
                sum += x1;
                pos -= x1;
                st.erase(p1);
            }   
            else{
                sum += y1;
                pos += y1;
                st.erase(p2);
            }
        }
        cout << sum << "\n";
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2532 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2532 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 74 ms 18516 KB Output is correct
18 Correct 84 ms 18512 KB Output is correct
19 Correct 74 ms 18500 KB Output is correct
20 Correct 85 ms 19004 KB Output is correct
21 Correct 75 ms 18276 KB Output is correct
22 Correct 88 ms 18320 KB Output is correct
23 Correct 75 ms 18516 KB Output is correct
24 Correct 77 ms 18768 KB Output is correct
25 Correct 82 ms 18516 KB Output is correct
26 Correct 81 ms 18516 KB Output is correct
27 Correct 79 ms 18508 KB Output is correct
28 Correct 82 ms 18512 KB Output is correct
29 Correct 77 ms 18256 KB Output is correct
30 Correct 75 ms 18256 KB Output is correct
31 Correct 76 ms 18408 KB Output is correct

Subtask #3
0 / 30.0

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

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2532 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 74 ms 18516 KB Output is correct
18 Correct 84 ms 18512 KB Output is correct
19 Correct 74 ms 18500 KB Output is correct
20 Correct 85 ms 19004 KB Output is correct
21 Correct 75 ms 18276 KB Output is correct
22 Correct 88 ms 18320 KB Output is correct
23 Correct 75 ms 18516 KB Output is correct
24 Correct 77 ms 18768 KB Output is correct
25 Correct 82 ms 18516 KB Output is correct
26 Correct 81 ms 18516 KB Output is correct
27 Correct 79 ms 18508 KB Output is correct
28 Correct 82 ms 18512 KB Output is correct
29 Correct 77 ms 18256 KB Output is correct
30 Correct 75 ms 18256 KB Output is correct
31 Correct 76 ms 18408 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Incorrect 1 ms 2396 KB Output isn't correct
34 Halted 0 ms 0 KB -