oj.uz

Submission #942150

# Submission time Handle Problem Language Result Execution time Memory
942150 2024-03-10T10:13:46 Z Mathias Cheap flights (LMIO18_pigus_skrydziai) C++14
12 / 100
 3000 ms 93628 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5+7;
long long t[MAXN]; 
vector<pair<int,int> > v;
vector<int>g[MAXN];
map<pair<int,int>,long long>w;
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int n,m,a,b,c,s;
	long long res=0;
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		cin>>a>>b>>c;
		t[a]+=c; t[b]+=c;
		g[a].push_back(b); g[b].push_back(a);
		v.push_back({a,b});
		w[{a,b}]=w[{b,a}]=c;
	}
	for(int i=1;i<=n;i++){
		res=max(res,t[i]);
	}
	for(auto k:v){
		a=k.first; b=k.second;
		for(int i=0;i<g[a].size();i++){
			s=g[a][i];
			if(w.count({b,s})) res=max(res,w[{a,b}]+w[{a,s}]+w[{b,s}]);
		}
	}
	cout<<res<<'\n';
	return 0;
}

Compilation message

pigus_skrydziai.cpp: In function 'int main()':
pigus_skrydziai.cpp:25:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |   for(int i=0;i<g[a].size();i++){
      |               ~^~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 3 ms 12952 KB Output is correct
3 Correct 4 ms 12892 KB Output is correct
4 Correct 3 ms 12916 KB Output is correct
5 Correct 2 ms 12892 KB Output is correct
6 Correct 737 ms 15832 KB Output is correct
7 Correct 4 ms 12892 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 5 ms 12904 KB Output is correct
14 Correct 3 ms 12892 KB Output is correct
15 Correct 4 ms 12888 KB Output is correct
16 Correct 3 ms 12892 KB Output is correct
17 Correct 3 ms 12892 KB Output is correct
18 Correct 5 ms 12892 KB Output is correct
19 Correct 8 ms 13144 KB Output is correct
20 Correct 3 ms 12892 KB Output is correct
21 Correct 3 ms 12892 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 3 ms 12952 KB Output is correct
3 Correct 4 ms 12892 KB Output is correct
4 Correct 3 ms 12916 KB Output is correct
5 Correct 2 ms 12892 KB Output is correct
6 Correct 737 ms 15832 KB Output is correct
7 Correct 4 ms 12892 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 5 ms 12904 KB Output is correct
14 Correct 3 ms 12892 KB Output is correct
15 Correct 4 ms 12888 KB Output is correct
16 Correct 3 ms 12892 KB Output is correct
17 Correct 3 ms 12892 KB Output is correct
18 Correct 5 ms 12892 KB Output is correct
19 Correct 8 ms 13144 KB Output is correct
20 Correct 3 ms 12892 KB Output is correct
21 Correct 3 ms 12892 KB Output is correct
22 Execution timed out 3026 ms 93628 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 46524 KB Output is correct
2 Correct 753 ms 69964 KB Output is correct
3 Correct 142 ms 32712 KB Output is correct
4 Correct 377 ms 49856 KB Output is correct
5 Correct 951 ms 67412 KB Output is correct
6 Execution timed out 3046 ms 31688 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 46524 KB Output is correct
2 Correct 753 ms 69964 KB Output is correct
3 Correct 142 ms 32712 KB Output is correct
4 Correct 377 ms 49856 KB Output is correct
5 Correct 951 ms 67412 KB Output is correct
6 Execution timed out 3046 ms 31688 KB Time limit exceeded
7 Halted 0 ms 0 KB -