oj.uz

Submission #995212

# Submission time Handle Problem Language Result Execution time Memory
995212 2024-06-08T16:08:02 Z modwwe Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 6944 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#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;
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])
            p.push({x.a+f.b,f.a,f.c});
    }
    return 2e9;
}
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]=2e9;
        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;
    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);
            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
        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>=2e9)cout<<-1;
 else cout<<s3;
}

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 860 KB Output is correct
2 Correct 6 ms 604 KB Output is correct
3 Correct 7 ms 860 KB Output is correct
4 Correct 9 ms 868 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 7 ms 812 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 27 ms 916 KB Output is correct
11 Correct 37 ms 860 KB Output is correct
12 Correct 34 ms 856 KB Output is correct
13 Correct 7 ms 860 KB Output is correct
14 Correct 8 ms 888 KB Output is correct
15 Correct 7 ms 860 KB Output is correct
16 Correct 8 ms 872 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 6896 KB Output is correct
2 Correct 41 ms 6908 KB Output is correct
3 Correct 35 ms 5588 KB Output is correct
4 Correct 7 ms 860 KB Output is correct
5 Correct 7 ms 860 KB Output is correct
6 Correct 6 ms 604 KB Output is correct
7 Correct 6 ms 816 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 24 ms 5244 KB Output is correct
10 Correct 22 ms 4852 KB Output is correct
11 Correct 94 ms 5588 KB Output is correct
12 Correct 56 ms 5752 KB Output is correct
13 Correct 67 ms 6696 KB Output is correct
14 Correct 73 ms 6940 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 860 KB Output is correct
2 Correct 6 ms 816 KB Output is correct
3 Correct 32 ms 5712 KB Output is correct
4 Correct 6 ms 604 KB Output is correct
5 Correct 30 ms 5644 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 22 ms 4884 KB Output is correct
9 Correct 19 ms 5396 KB Output is correct
10 Correct 72 ms 6752 KB Output is correct
11 Correct 42 ms 6480 KB Output is correct
12 Correct 95 ms 6772 KB Output is correct
13 Correct 0 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 1 ms 348 KB Output is correct
19 Correct 50 ms 6732 KB Output is correct
20 Correct 39 ms 6264 KB Output is correct
21 Correct 83 ms 6944 KB Output is correct
22 Correct 60 ms 5492 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 860 KB Output is correct
2 Correct 6 ms 604 KB Output is correct
3 Correct 7 ms 860 KB Output is correct
4 Correct 9 ms 868 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 7 ms 812 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 27 ms 916 KB Output is correct
11 Correct 37 ms 860 KB Output is correct
12 Correct 34 ms 856 KB Output is correct
13 Correct 7 ms 860 KB Output is correct
14 Correct 8 ms 888 KB Output is correct
15 Correct 7 ms 860 KB Output is correct
16 Correct 8 ms 872 KB Output is correct
17 Correct 38 ms 6896 KB Output is correct
18 Correct 41 ms 6908 KB Output is correct
19 Correct 35 ms 5588 KB Output is correct
20 Correct 7 ms 860 KB Output is correct
21 Correct 7 ms 860 KB Output is correct
22 Correct 6 ms 604 KB Output is correct
23 Correct 6 ms 816 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 24 ms 5244 KB Output is correct
26 Correct 22 ms 4852 KB Output is correct
27 Correct 94 ms 5588 KB Output is correct
28 Correct 56 ms 5752 KB Output is correct
29 Correct 67 ms 6696 KB Output is correct
30 Correct 73 ms 6940 KB Output is correct
31 Correct 8 ms 860 KB Output is correct
32 Correct 6 ms 816 KB Output is correct
33 Correct 32 ms 5712 KB Output is correct
34 Correct 6 ms 604 KB Output is correct
35 Correct 30 ms 5644 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 22 ms 4884 KB Output is correct
39 Correct 19 ms 5396 KB Output is correct
40 Correct 72 ms 6752 KB Output is correct
41 Correct 42 ms 6480 KB Output is correct
42 Correct 95 ms 6772 KB Output is correct
43 Correct 0 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 1 ms 348 KB Output is correct
49 Correct 50 ms 6732 KB Output is correct
50 Correct 39 ms 6264 KB Output is correct
51 Correct 83 ms 6944 KB Output is correct
52 Correct 60 ms 5492 KB Output is correct
53 Correct 42 ms 6760 KB Output is correct
54 Correct 55 ms 6940 KB Output is correct
55 Correct 36 ms 6672 KB Output is correct
56 Correct 8 ms 1112 KB Output is correct
57 Correct 7 ms 860 KB Output is correct
58 Correct 999 ms 5752 KB Output is correct
59 Execution timed out 1063 ms 4936 KB Time limit exceeded
60 Halted 0 ms 0 KB -