oj.uz

Submission #995275

# Submission time Handle Problem Language Result Execution time Memory
995275 2024-06-08T18:06:56 Z modwwe Olympic Bus (JOI20_ho_t4) C++17
100 / 100
 947 ms 4300 KB 
#include<bits/stdc++.h>
//#define int long long
//#define ll long long
#define down cout<<'\n';
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
const int inf=1e9;

void phongbeo();
const int mod2=1e9+7;
const int  mod1=998244353;
struct icd
{
    int a,b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c, d,e,f;

};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l;
int  i,s10,s12;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
    //fin(task),fou(task);
#endif
    NHP
    /// cin>>s1;
    // modwwe
    phongbeo(),down
}
struct cmp
{
    bool operator()(ic a,ic b)
    {
        return a.a>b.a;
    }
};
int color[201];
vector<ic> v[201];
int dp[201][201];
id a[50001];
bool b[50001];

int diditcha(int c,int y)
{
    priority_queue<ic,vector<ic>,cmp>p;
    p.push({0,c,0});
    memset(color,-1,sizeof color);
    while(!p.empty())
    {
        ic x=p.top();
        p.pop();
        if(color[x.b]!=-1) continue;
        color[x.b]=x.c;
        if(x.b==y) return x.a;
        for(auto f:v[x.b])
            if(color[f.a]==-1)
            p.push({x.a+f.b,f.a,f.c});
    }
    return inf;
}
void del(int x,int y)
{
    for(int i=0; i<v[x].size(); i++)
        if(v[x][i].c==y)
        {
            v[x].erase(v[x].begin()+i);
            return;
        }
}
void add(int x,int y,int s2,int c)
{
    v[x].pb({y,s2,c});
}
void phongbeo()
{
    cin>>n;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            dp[i][j]=inf;
        dp[i][i]=0;
    }
    cin>>m;
    for(int j=1; j<=m; j++)
    {
        cin>>l>>r>>s2>>s3;
        a[j]= {l,r,s2,s3};
        v[l].pb({r,s2,j});
        dp[l][r]=min(dp[l][r],s2);
    }
    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
                dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
            s4+=diditcha(1,n);
    s2=n;
    while(color[s2]!=-1)
    {        b[color[s2]]=1,s2=a[color[s2]].a;
    }
    s5+= diditcha(n,1);
    s3=s4+s5;
    s2=1;
    if(s3>=inf) s3=2*inf;
    while(color[s2]!=-1)
    {
        b[color[s2]]=1,s2=a[color[s2]].a;
    }
    for(int j=1; j<=m; j++)
        if(b[j])
        {
            del(a[j].a,j),add(a[j].b,a[j].a,a[j].c,j);
            s5=diditcha(1,n);
            s4=diditcha(n,1);
            if(s4<inf&&s5<inf)
            s3=min({s4+s5+a[j].d,s3});
            del(a[j].b,j),add(a[j].a,a[j].b,a[j].c,j);
        }
        else{
                 if(min(dp[1][a[j].b]+dp[a[j].a][n]+a[j].c,dp[1][n])<inf&&min(dp[n][a[j].b]+dp[a[j].a][1]+a[j].c,dp[n][1])+a[j].d<inf)
        s3=min(s3,min(dp[1][a[j].b]+dp[a[j].a][n]+a[j].c,dp[1][n])+min(dp[n][a[j].b]+dp[a[j].a][1]+a[j].c,dp[n][1])+a[j].d);}
 if(s3>=2*inf)cout<<-1;
 else cout<<s3;
}

Compilation message

ho_t4.cpp:45:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   45 | main()
      | ^~~~
ho_t4.cpp: In function 'void del(int, int)':
ho_t4.cpp:88:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<ic>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     for(int i=0; i<v[x].size(); i++)
      |                  ~^~~~~~~~~~~~
ho_t4.cpp: In function 'void phongbeo()':
ho_t4.cpp:117:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  117 |         for(int i=1; i<=n; i++)
      |         ^~~
ho_t4.cpp:120:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  120 |             s4+=diditcha(1,n);
      |             ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 604 KB Output is correct
2 Correct 7 ms 636 KB Output is correct
3 Correct 8 ms 604 KB Output is correct
4 Correct 8 ms 668 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 17 ms 604 KB Output is correct
11 Correct 19 ms 672 KB Output is correct
12 Correct 20 ms 604 KB Output is correct
13 Correct 7 ms 604 KB Output is correct
14 Correct 8 ms 604 KB Output is correct
15 Correct 8 ms 604 KB Output is correct
16 Correct 8 ms 604 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 3108 KB Output is correct
2 Correct 27 ms 3112 KB Output is correct
3 Correct 25 ms 3012 KB Output is correct
4 Correct 8 ms 604 KB Output is correct
5 Correct 8 ms 604 KB Output is correct
6 Correct 7 ms 644 KB Output is correct
7 Correct 7 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 20 ms 2532 KB Output is correct
10 Correct 20 ms 2412 KB Output is correct
11 Correct 39 ms 2784 KB Output is correct
12 Correct 31 ms 2912 KB Output is correct
13 Correct 33 ms 3088 KB Output is correct
14 Correct 36 ms 3180 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 600 KB Output is correct
2 Correct 9 ms 604 KB Output is correct
3 Correct 23 ms 2484 KB Output is correct
4 Correct 8 ms 604 KB Output is correct
5 Correct 22 ms 3000 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 18 ms 2664 KB Output is correct
9 Correct 20 ms 2732 KB Output is correct
10 Correct 39 ms 3056 KB Output is correct
11 Correct 34 ms 2996 KB Output is correct
12 Correct 40 ms 2944 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 33 ms 3036 KB Output is correct
20 Correct 29 ms 2980 KB Output is correct
21 Correct 35 ms 3044 KB Output is correct
22 Correct 29 ms 3004 KB Output is correct

Subtask #4
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 604 KB Output is correct
2 Correct 7 ms 636 KB Output is correct
3 Correct 8 ms 604 KB Output is correct
4 Correct 8 ms 668 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 17 ms 604 KB Output is correct
11 Correct 19 ms 672 KB Output is correct
12 Correct 20 ms 604 KB Output is correct
13 Correct 7 ms 604 KB Output is correct
14 Correct 8 ms 604 KB Output is correct
15 Correct 8 ms 604 KB Output is correct
16 Correct 8 ms 604 KB Output is correct
17 Correct 26 ms 3108 KB Output is correct
18 Correct 27 ms 3112 KB Output is correct
19 Correct 25 ms 3012 KB Output is correct
20 Correct 8 ms 604 KB Output is correct
21 Correct 8 ms 604 KB Output is correct
22 Correct 7 ms 644 KB Output is correct
23 Correct 7 ms 600 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 20 ms 2532 KB Output is correct
26 Correct 20 ms 2412 KB Output is correct
27 Correct 39 ms 2784 KB Output is correct
28 Correct 31 ms 2912 KB Output is correct
29 Correct 33 ms 3088 KB Output is correct
30 Correct 36 ms 3180 KB Output is correct
31 Correct 8 ms 600 KB Output is correct
32 Correct 9 ms 604 KB Output is correct
33 Correct 23 ms 2484 KB Output is correct
34 Correct 8 ms 604 KB Output is correct
35 Correct 22 ms 3000 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 18 ms 2664 KB Output is correct
39 Correct 20 ms 2732 KB Output is correct
40 Correct 39 ms 3056 KB Output is correct
41 Correct 34 ms 2996 KB Output is correct
42 Correct 40 ms 2944 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 33 ms 3036 KB Output is correct
50 Correct 29 ms 2980 KB Output is correct
51 Correct 35 ms 3044 KB Output is correct
52 Correct 29 ms 3004 KB Output is correct
53 Correct 30 ms 3040 KB Output is correct
54 Correct 44 ms 3088 KB Output is correct
55 Correct 29 ms 3036 KB Output is correct
56 Correct 8 ms 604 KB Output is correct
57 Correct 8 ms 676 KB Output is correct
58 Correct 421 ms 2744 KB Output is correct
59 Correct 497 ms 2556 KB Output is correct
60 Correct 791 ms 2556 KB Output is correct
61 Correct 440 ms 3440 KB Output is correct
62 Correct 507 ms 3384 KB Output is correct
63 Correct 730 ms 3180 KB Output is correct
64 Correct 679 ms 3720 KB Output is correct
65 Correct 720 ms 3824 KB Output is correct
66 Correct 947 ms 3628 KB Output is correct
67 Correct 12 ms 3540 KB Output is correct
68 Correct 21 ms 3772 KB Output is correct
69 Correct 20 ms 3676 KB Output is correct
70 Correct 43 ms 4104 KB Output is correct
71 Correct 41 ms 4160 KB Output is correct
72 Correct 34 ms 3900 KB Output is correct
73 Correct 46 ms 4300 KB Output is correct
74 Correct 42 ms 4208 KB Output is correct