oj.uz

답안 #971671

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971671 2024-04-29T07:17:04 Z vjudge1 Bitaro's travel (JOI23_travel) C++17
15 / 100
 88 ms 18000 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;
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});
    }
    cin >> tt;
    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 2508 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 2652 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 2396 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 2396 KB Output is correct
14 Correct 1 ms 2648 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 2508 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 2652 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 2396 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 2396 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 75 ms 17748 KB Output is correct
18 Correct 86 ms 17792 KB Output is correct
19 Correct 75 ms 17844 KB Output is correct
20 Correct 80 ms 18000 KB Output is correct
21 Correct 74 ms 17744 KB Output is correct
22 Correct 88 ms 17852 KB Output is correct
23 Correct 72 ms 17748 KB Output is correct
24 Correct 71 ms 17660 KB Output is correct
25 Correct 80 ms 17780 KB Output is correct
26 Correct 85 ms 17748 KB Output is correct
27 Correct 77 ms 17612 KB Output is correct
28 Correct 77 ms 17748 KB Output is correct
29 Correct 76 ms 17744 KB Output is correct
30 Correct 75 ms 17804 KB Output is correct
31 Correct 80 ms 17800 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 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 2508 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 2652 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 2396 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 2396 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 75 ms 17748 KB Output is correct
18 Correct 86 ms 17792 KB Output is correct
19 Correct 75 ms 17844 KB Output is correct
20 Correct 80 ms 18000 KB Output is correct
21 Correct 74 ms 17744 KB Output is correct
22 Correct 88 ms 17852 KB Output is correct
23 Correct 72 ms 17748 KB Output is correct
24 Correct 71 ms 17660 KB Output is correct
25 Correct 80 ms 17780 KB Output is correct
26 Correct 85 ms 17748 KB Output is correct
27 Correct 77 ms 17612 KB Output is correct
28 Correct 77 ms 17748 KB Output is correct
29 Correct 76 ms 17744 KB Output is correct
30 Correct 75 ms 17804 KB Output is correct
31 Correct 80 ms 17800 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Incorrect 1 ms 2396 KB Output isn't correct
34 Halted 0 ms 0 KB -