oj.uz

Submission #536314

# Submission time Handle Problem Language Result Execution time Memory
536314 2022-03-12T20:19:08 Z ammar2000 Cheap flights (LMIO18_pigus_skrydziai) C++17
12 / 100
 3000 ms 191848 KB 
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=4e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,m;
vector  <pair <ll,ll> > v[SI];
map <pair < ll,ll>,ll > mp;
ll ans=0;
void dfs(int x,int st,int len,int sum)
{
    if (len==2)
    {
        if (mp[{x,st}]==0)
            return ;
        ans=max(ans,sum+mp[{x,st}]);
        return ;
    }
    for (auto i:v[st])
    {
        if (i.F!=st)
            dfs(x,i.F,len+1,sum+i.S);
    }
}
int main()
{
   fast
   cin>>n>>m;
   for (int i=0;i<m;i++)
   {
       ll x,y,z;
       cin>>x>>y>>z;
       mp[{x,y}]=mp[{y,x}]=z;
       v[x].pb({y,z});
       v[y].pb({x,z});
   }
   for (int i=1;i<=n;i++)
   {
      ll sum=0;
      for (auto e:v[i])
        sum+=e.S;
      ans=max(ans,sum);
      dfs(i,i,0,0);
   }
   cout <<ans <<"\n";
   // use scanf not cin
   return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9724 KB Output is correct
2 Correct 5 ms 9724 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9608 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 872 ms 13400 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 6 ms 9716 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 7 ms 10068 KB Output is correct
12 Correct 6 ms 9848 KB Output is correct
13 Correct 6 ms 9684 KB Output is correct
14 Correct 5 ms 9720 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9716 KB Output is correct
18 Correct 11 ms 10368 KB Output is correct
19 Correct 19 ms 12104 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9724 KB Output is correct
2 Correct 5 ms 9724 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9608 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 872 ms 13400 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 6 ms 9716 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 7 ms 10068 KB Output is correct
12 Correct 6 ms 9848 KB Output is correct
13 Correct 6 ms 9684 KB Output is correct
14 Correct 5 ms 9720 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9716 KB Output is correct
18 Correct 11 ms 10368 KB Output is correct
19 Correct 19 ms 12104 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Execution timed out 3063 ms 184484 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 58904 KB Output is correct
2 Correct 865 ms 123404 KB Output is correct
3 Correct 247 ms 47384 KB Output is correct
4 Correct 489 ms 82508 KB Output is correct
5 Correct 1522 ms 191848 KB Output is correct
6 Execution timed out 3085 ms 30584 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 58904 KB Output is correct
2 Correct 865 ms 123404 KB Output is correct
3 Correct 247 ms 47384 KB Output is correct
4 Correct 489 ms 82508 KB Output is correct
5 Correct 1522 ms 191848 KB Output is correct
6 Execution timed out 3085 ms 30584 KB Time limit exceeded
7 Halted 0 ms 0 KB -