oj.uz

Submission #906448

# Submission time Handle Problem Language Result Execution time Memory
906448 2024-01-14T10:05:39 Z pcc Cheap flights (LMIO18_pigus_skrydziai) C++14
28 / 100
 3000 ms 81560 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,popcnt")

#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>


const int mxn = 3e5+10;
const int lim = 2.95*CLOCKS_PER_SEC;
int N,M;
unordered_map<int,ll> mp[mxn];
vector<tlll> edges;
ll sum[mxn];

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int st = clock();
	cin>>N>>M;
	for(int i = 0;i<M;i++){
		int a,b,c;
		cin>>a>>b>>c;
		mp[a][b] = c;
		mp[b][a] = c;
		sum[a] += c;
		sum[b] += c;
		edges.push_back(make_tuple(a,b,c));
	}
	random_shuffle(edges.begin(),edges.end());
	ll ans = *max_element(sum,sum+N+1);
	for(auto &i:edges){
		int a = get<0>(i),b = get<1>(i),ts = get<2>(i);
		if(mp[a].size()>mp[b].size())swap(a,b);
		for(auto &j:mp[a]){
			if(clock()-st>=lim)break;
			if(mp[b].find(j.fs) != mp[b].end()){
				ans = max(ans,mp[b][j.fs]+j.sc+ts);
			}
		}
		if(clock()-st>=lim)break;
	}
	cout<<ans;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16984 KB Output is correct
2 Correct 6 ms 16984 KB Output is correct
3 Correct 5 ms 16988 KB Output is correct
4 Correct 5 ms 16988 KB Output is correct
5 Correct 5 ms 16988 KB Output is correct
6 Correct 1313 ms 19096 KB Output is correct
7 Correct 6 ms 16984 KB Output is correct
8 Correct 6 ms 16988 KB Output is correct
9 Correct 6 ms 16848 KB Output is correct
10 Correct 6 ms 16988 KB Output is correct
11 Correct 7 ms 16988 KB Output is correct
12 Correct 7 ms 16988 KB Output is correct
13 Correct 6 ms 16984 KB Output is correct
14 Correct 5 ms 16988 KB Output is correct
15 Correct 6 ms 16988 KB Output is correct
16 Correct 6 ms 17184 KB Output is correct
17 Correct 6 ms 16988 KB Output is correct
18 Correct 12 ms 17136 KB Output is correct
19 Correct 20 ms 17244 KB Output is correct
20 Correct 7 ms 16988 KB Output is correct
21 Correct 6 ms 16832 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16984 KB Output is correct
2 Correct 6 ms 16984 KB Output is correct
3 Correct 5 ms 16988 KB Output is correct
4 Correct 5 ms 16988 KB Output is correct
5 Correct 5 ms 16988 KB Output is correct
6 Correct 1313 ms 19096 KB Output is correct
7 Correct 6 ms 16984 KB Output is correct
8 Correct 6 ms 16988 KB Output is correct
9 Correct 6 ms 16848 KB Output is correct
10 Correct 6 ms 16988 KB Output is correct
11 Correct 7 ms 16988 KB Output is correct
12 Correct 7 ms 16988 KB Output is correct
13 Correct 6 ms 16984 KB Output is correct
14 Correct 5 ms 16988 KB Output is correct
15 Correct 6 ms 16988 KB Output is correct
16 Correct 6 ms 17184 KB Output is correct
17 Correct 6 ms 16988 KB Output is correct
18 Correct 12 ms 17136 KB Output is correct
19 Correct 20 ms 17244 KB Output is correct
20 Correct 7 ms 16988 KB Output is correct
21 Correct 6 ms 16832 KB Output is correct
22 Execution timed out 3039 ms 70840 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 65276 KB Output is correct
2 Correct 952 ms 81560 KB Output is correct
3 Correct 249 ms 38572 KB Output is correct
4 Correct 537 ms 58864 KB Output is correct
5 Correct 1266 ms 69864 KB Output is correct
6 Correct 2983 ms 29700 KB Output is correct
7 Correct 518 ms 69508 KB Output is correct
8 Correct 658 ms 79260 KB Output is correct
9 Correct 8 ms 19544 KB Output is correct
10 Correct 2986 ms 29896 KB Output is correct
11 Correct 615 ms 67828 KB Output is correct
12 Correct 2995 ms 42796 KB Output is correct
13 Correct 6 ms 16984 KB Output is correct
14 Correct 2972 ms 28164 KB Output is correct

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 65276 KB Output is correct
2 Correct 952 ms 81560 KB Output is correct
3 Correct 249 ms 38572 KB Output is correct
4 Correct 537 ms 58864 KB Output is correct
5 Correct 1266 ms 69864 KB Output is correct
6 Correct 2983 ms 29700 KB Output is correct
7 Correct 518 ms 69508 KB Output is correct
8 Correct 658 ms 79260 KB Output is correct
9 Correct 8 ms 19544 KB Output is correct
10 Correct 2986 ms 29896 KB Output is correct
11 Correct 615 ms 67828 KB Output is correct
12 Correct 2995 ms 42796 KB Output is correct
13 Correct 6 ms 16984 KB Output is correct
14 Correct 2972 ms 28164 KB Output is correct
15 Correct 5 ms 16984 KB Output is correct
16 Correct 6 ms 16984 KB Output is correct
17 Correct 5 ms 16988 KB Output is correct
18 Correct 5 ms 16988 KB Output is correct
19 Correct 5 ms 16988 KB Output is correct
20 Correct 1313 ms 19096 KB Output is correct
21 Correct 6 ms 16984 KB Output is correct
22 Correct 6 ms 16988 KB Output is correct
23 Correct 6 ms 16848 KB Output is correct
24 Correct 6 ms 16988 KB Output is correct
25 Correct 7 ms 16988 KB Output is correct
26 Correct 7 ms 16988 KB Output is correct
27 Correct 6 ms 16984 KB Output is correct
28 Correct 5 ms 16988 KB Output is correct
29 Correct 6 ms 16988 KB Output is correct
30 Correct 6 ms 17184 KB Output is correct
31 Correct 6 ms 16988 KB Output is correct
32 Correct 12 ms 17136 KB Output is correct
33 Correct 20 ms 17244 KB Output is correct
34 Correct 7 ms 16988 KB Output is correct
35 Correct 6 ms 16832 KB Output is correct
36 Execution timed out 3039 ms 70840 KB Time limit exceeded
37 Halted 0 ms 0 KB -