oj.uz

답안 #290069

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
290069 2020-09-03T11:08:18 Z Mercenary Sky Walking (IOI19_walk) C++14
33 / 100
 752 ms 27508 KB 
#ifndef LOCAL
#include "walk.h"
#endif // LOCAL
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>

#define pb push_back
#define mp make_pair
#define taskname "A"

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int maxn = 1e5 + 5;
int n , m;
struct IT{
    ll s[maxn * 4];
    void update(int x , int l , int r , int pos , ll val){
        if(l == r){
            s[x] = val;return;
        }
        int mid = l + r >> 1;
        if(pos <= mid)update(x * 2 , l , mid , pos , val);
        else update(x * 2 + 1 , mid + 1 , r , pos , val);
        s[x] = min(s[x * 2] , s[x * 2 + 1]);
    }
    ll query(int x , int l , int r , int L , int R){
        if(l > R || L > r)return 1e18;
        if(L <= l && r <= R)return s[x];
        int mid = l + r >> 1;
        return min(query(x * 2 , l , mid , L , R) , query(x * 2 + 1 , mid + 1 , r , L , R));
    }
    void init(){
        fill_n(s,maxn*4,1e18);
    }
}s1 , s2;

long long min_distance(std::vector<int> x, std::vector<int> h, std::vector<int> l, std::vector<int> r, std::vector<int> y, int s, int g) {
    n = x.size();m = l.size();
    s = 0 , g = n - 1;
    for(int i = 0 ; i < n ; ++i)h[i] = 1e9;
    vector<vector<int>> del(n , vector<int>(0));
    vector<vector<int>> add(n , vector<int>(0));
    vector<int> order(m);iota(order.begin(),order.end(),0);
    vector<int> id(m);
    sort(order.begin(),order.end(),[&](const int a , const int b){
            return y[a] < y[b];
         });
    for(int i = 0 ; i < m ; ++i)id[order[i]] = i;
    for(int i = 0 ; i < m ; ++i){
        add[l[i]].pb(i);
        del[r[i]].pb(i);
    }
    ll res = 1e18;
    s1.init();s2.init();
    set<int> ss;
    for(int i = 0 ; i < n ; ++i){
        if(i > 0){
            for(auto c : del[i - 1])ss.erase(id[c]);
            for(auto c : del[i - 1]){
                auto it = ss.lower_bound(id[c]);
                auto update = [&](int c){
                    ll cur = min(s1.query(1,1,m,1,id[c]+1) + y[c], s2.query(1,1,m,id[c]+1,m)-y[c]);
                    s1.update(1,1,m,id[c]+1,min(s1.query(1,1,m,id[c]+1,id[c]+1),cur-y[c]));
                    s2.update(1,1,m,id[c]+1,min(s2.query(1,1,m,id[c]+1,id[c]+1),cur+y[c]));
                };
                if(it != ss.end())update(order[*it]);
                if(it != ss.begin())update(order[*prev(it)]);
            }
            for(auto & c : del[i - 1]){
                s1.update(1,1,m,id[c]+1,1e18);
                s2.update(1,1,m,id[c]+1,1e18);
            }
        }
        for(auto c : add[i]){
            ll cur = min(s1.query(1,1,m,1,id[c]+1) + y[c], s2.query(1,1,m,id[c]+1,m)-y[c]);
            if(i == 0)cur = y[c];
            ss.insert(id[c]);
            s1.update(1,1,m,id[c]+1,cur-y[c]);
            s2.update(1,1,m,id[c]+1,cur+y[c]);
        }
    }
    for(auto c : del[n - 1]){
        ll cur = min(s1.query(1,1,m,1,id[c]+1) + y[c], s2.query(1,1,m,id[c]+1,m)-y[c]);
        res = min(res , cur + y[c]);
    }
    if(res > 1e15)res = -1;
    else res += x[n - 1] - x[0];
    return res;

}

#ifdef LOCAL
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
		freopen(taskname".INP", "r",stdin);
		freopen(taskname".OUT", "w",stdout);
    }
    int n, m;
	assert(2 == scanf("%d%d", &n, &m));
	vector<int> x(n), h(n);
	for (int i = 0; i < n; i++)
		assert(2 == scanf("%d%d", &x[i], &h[i]));
	vector<int> l(m), r(m), y(m);
	for (int i = 0; i < m; i++)
		assert(3 == scanf("%d%d%d", &l[i], &r[i], &y[i]));
	int s, g;
	assert(2 == scanf("%d%d", &s, &g));
	fclose(stdin);

	long long result = min_distance(x, h, l, r, y, s, g);

	printf("%lld\n", result);
	fclose(stdout);
	return 0;
}
#endif // LOCAL

Compilation message

walk.cpp: In member function 'void IT::update(int, int, int, int, ll)':
walk.cpp:28:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |         int mid = l + r >> 1;
      |                   ~~^~~
walk.cpp: In member function 'll IT::query(int, int, int, int, int)':
walk.cpp:36:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   36 |         int mid = l + r >> 1;
      |                   ~~^~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 14.0

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

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 195 ms 9780 KB Output is correct
2 Correct 559 ms 11256 KB Output is correct
3 Correct 606 ms 12280 KB Output is correct
4 Correct 639 ms 20240 KB Output is correct
5 Correct 724 ms 23160 KB Output is correct
6 Correct 635 ms 21980 KB Output is correct
7 Correct 282 ms 17400 KB Output is correct
8 Correct 418 ms 22264 KB Output is correct
9 Correct 529 ms 27380 KB Output is correct
10 Correct 368 ms 25580 KB Output is correct
11 Correct 21 ms 10488 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 195 ms 9780 KB Output is correct
2 Correct 559 ms 11256 KB Output is correct
3 Correct 606 ms 12280 KB Output is correct
4 Correct 639 ms 20240 KB Output is correct
5 Correct 724 ms 23160 KB Output is correct
6 Correct 635 ms 21980 KB Output is correct
7 Correct 282 ms 17400 KB Output is correct
8 Correct 418 ms 22264 KB Output is correct
9 Correct 529 ms 27380 KB Output is correct
10 Correct 368 ms 25580 KB Output is correct
11 Correct 21 ms 10488 KB Output is correct
12 Correct 592 ms 14348 KB Output is correct
13 Correct 663 ms 24440 KB Output is correct
14 Correct 720 ms 27260 KB Output is correct
15 Correct 456 ms 23836 KB Output is correct
16 Correct 505 ms 24304 KB Output is correct
17 Correct 519 ms 24056 KB Output is correct
18 Correct 453 ms 23800 KB Output is correct
19 Correct 495 ms 24184 KB Output is correct
20 Correct 287 ms 20448 KB Output is correct
21 Correct 46 ms 14972 KB Output is correct
22 Correct 407 ms 21880 KB Output is correct
23 Correct 408 ms 22136 KB Output is correct
24 Correct 384 ms 23416 KB Output is correct
25 Correct 388 ms 22136 KB Output is correct
26 Correct 367 ms 25520 KB Output is correct
27 Correct 752 ms 26908 KB Output is correct
28 Correct 577 ms 23936 KB Output is correct
29 Correct 612 ms 25976 KB Output is correct
30 Correct 296 ms 20344 KB Output is correct
31 Correct 536 ms 27508 KB Output is correct
32 Correct 387 ms 23672 KB Output is correct
33 Correct 408 ms 25336 KB Output is correct
34 Correct 352 ms 24688 KB Output is correct
35 Correct 415 ms 23928 KB Output is correct
36 Correct 427 ms 23416 KB Output is correct
37 Correct 418 ms 21880 KB Output is correct
38 Correct 425 ms 25336 KB Output is correct
39 Correct 329 ms 26228 KB Output is correct
40 Correct 399 ms 24440 KB Output is correct
41 Correct 415 ms 22776 KB Output is correct

Subtask #5
0 / 43.0

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