oj.uz

답안 #351844

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
351844 2021-01-20T08:44:45 Z beksultan04 Shortcut (IOI16_shortcut) C++14
0 / 100
 17 ms 23788 KB 
#include "shortcut.h"
#ifndef EVAL
#include "grader.cpp"
#endif // EVAL
#include <bits/stdc++.h>
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const lol INF = 1e17+1;
lol dia,iz,dis[1000001];
vector <pair<int,lol>> g[1000001];

lol find_shortcut(int n, vector<int> l, vector<int> d, int c){
    int i,j,x=0,y=0,pos=0;
    lol ans = -1,mx = 0,res=INF;
    vector <pair<lol,pii> > v;

    for (i=0;i<n;++i){
        g[i].pb({i+n,d[i]});
        g[i+n].pb({i,d[i]});
        if (i+1 < n){
            g[i].pb({i+1,l[i]});
            g[i+1].pb({i,l[i]});
        }
    }

    for (i=0;i<n;++i){
        mx = d[i];
        for (j=i+1;j<n;++j){
            mx += l[j-1];
            v.pb({mx,{i,j}});
            if (mx+d[j] > ans){
                ans = mx+d[j];
                x = i;
                y = j;
            }
        }
    }
    sort(allr(v));
    for (int h=0;h<v.size()/2;++h){
        x = v[h].sc.fr;
        y = v[h].sc.sc;
        ans = 0;
        g[x].pb({y,c});
        g[y].pb({x,c});
        for (int start = 0;start < 2*n;++start){
            priority_queue <pair<lol,int>> s;
            for (i=0;i<n*2;++i)dis[i] = INF;
            s.push({0,start});
            dis[start] = 0;
            while (!s.empty()){
                int xx = s.top().sc;
                s.pop();
                for (pair<int,lol> to: g[xx]){
                    if (to.sc+dis[xx] < dis[to.fr]){
                        dis[to.fr] = to.sc+dis[xx];
                        s.push({-dis[to.fr],to.fr});
                    }
                }
            }
            for (i=0;i<n*2;++i){
                if (dis[i] > ans && dis[i] != INF){
                    ans = dis[i];
                }
            }
        }
        g[x].pop_back();
        g[y].pop_back();
        res = min(res,ans);

    }

    ret res;
}

Compilation message

shortcut.cpp: In function 'long long int find_shortcut(int, std::vector<int>, std::vector<int>, int)':
shortcut.cpp:58:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for (int h=0;h<v.size()/2;++h){
      |                  ~^~~~~~~~~~~
shortcut.cpp:32:21: warning: unused variable 'pos' [-Wunused-variable]
   32 |     int i,j,x=0,y=0,pos=0;
      |                     ^~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23788 KB n = 4, 80 is a correct answer
2 Correct 17 ms 23788 KB n = 9, 110 is a correct answer
3 Correct 17 ms 23788 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23788 KB n = 3, 4 is a correct answer
5 Incorrect 16 ms 23788 KB n = 2, incorrect answer: jury 62 vs contestant 100000000000000000
6 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23788 KB n = 4, 80 is a correct answer
2 Correct 17 ms 23788 KB n = 9, 110 is a correct answer
3 Correct 17 ms 23788 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23788 KB n = 3, 4 is a correct answer
5 Incorrect 16 ms 23788 KB n = 2, incorrect answer: jury 62 vs contestant 100000000000000000
6 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23788 KB n = 4, 80 is a correct answer
2 Correct 17 ms 23788 KB n = 9, 110 is a correct answer
3 Correct 17 ms 23788 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23788 KB n = 3, 4 is a correct answer
5 Incorrect 16 ms 23788 KB n = 2, incorrect answer: jury 62 vs contestant 100000000000000000
6 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23788 KB n = 4, 80 is a correct answer
2 Correct 17 ms 23788 KB n = 9, 110 is a correct answer
3 Correct 17 ms 23788 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23788 KB n = 3, 4 is a correct answer
5 Incorrect 16 ms 23788 KB n = 2, incorrect answer: jury 62 vs contestant 100000000000000000
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23788 KB n = 4, 80 is a correct answer
2 Correct 17 ms 23788 KB n = 9, 110 is a correct answer
3 Correct 17 ms 23788 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23788 KB n = 3, 4 is a correct answer
5 Incorrect 16 ms 23788 KB n = 2, incorrect answer: jury 62 vs contestant 100000000000000000
6 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23788 KB n = 4, 80 is a correct answer
2 Correct 17 ms 23788 KB n = 9, 110 is a correct answer
3 Correct 17 ms 23788 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23788 KB n = 3, 4 is a correct answer
5 Incorrect 16 ms 23788 KB n = 2, incorrect answer: jury 62 vs contestant 100000000000000000
6 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23788 KB n = 4, 80 is a correct answer
2 Correct 17 ms 23788 KB n = 9, 110 is a correct answer
3 Correct 17 ms 23788 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23788 KB n = 3, 4 is a correct answer
5 Incorrect 16 ms 23788 KB n = 2, incorrect answer: jury 62 vs contestant 100000000000000000
6 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23788 KB n = 4, 80 is a correct answer
2 Correct 17 ms 23788 KB n = 9, 110 is a correct answer
3 Correct 17 ms 23788 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23788 KB n = 3, 4 is a correct answer
5 Incorrect 16 ms 23788 KB n = 2, incorrect answer: jury 62 vs contestant 100000000000000000
6 Halted 0 ms 0 KB -