oj.uz

답안 #500598

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500598 2021-12-31T13:54:33 Z GenericAccount Cheap flights (LMIO18_pigus_skrydziai) C++17
100 / 100
 565 ms 56732 KB 
#include <bits/stdc++.h>

using namespace std;

long long N, M;
// N-miestu skaicius, M-poru skaicius

struct Best {
  long long to;
  long long pelnas;
  Best() {
    this->to = -1;
    this->pelnas = -1;
  }
};

map<pair<long long, long long>, long long>pelnas;

void checkForBest(long long a, long long b, long long pelnas, vector<pair<Best, Best>> & pelningiausi) {
  if (pelnas > pelningiausi[a].first.pelnas) {
    pelningiausi[a].second = pelningiausi[a].first;
    pelningiausi[a].first.to = b;
    pelningiausi[a].first.pelnas = pelnas;
  }
  else if(pelnas>pelningiausi[a].second.pelnas){
     pelningiausi[a].second.to = b;
     pelningiausi[a].second.pelnas = pelnas;
  }
}

int main() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);
  cin >> N >> M;
  vector<pair<Best, Best>> pelningiausi(N);
  vector<long long> visas_pelnas(N);
  long long a, b, p;
  for (long long i = 0; i < M; i++) {
    cin >> a >> b >> p;

    visas_pelnas[a - 1] += p;
    visas_pelnas[b - 1] += p;
    checkForBest(a - 1, b - 1, p, pelningiausi);
    checkForBest(b - 1, a - 1, p, pelningiausi);
    if (b > a)
      swap(a, b);
    pelnas[make_pair(a - 1, b - 1)] = p;
  }

  long long best = 0;
  for (long long peln : visas_pelnas) {
    best = max(best, peln);
  }

  for (int i = 0; i < pelningiausi.size(); i++) {
      b = min(pelningiausi[i].first.to, pelningiausi[i].second.to);
    if (b != -1) {
      a = max(pelningiausi[i].first.to, pelningiausi[i].second.to);
      long long tri=pelningiausi[i].first.pelnas + pelningiausi[i].second.pelnas + pelnas[make_pair(a, b)];
      best=max(best, tri);
    }
  }
  // for(pair<Best, Best> bp : pelningiausi){
  //   cout<<bp.first.to<<" "<<bp.first.pelnas<<endl;
  //   cout<<bp.second.to<<" "<<bp.second.pelnas<<endl;
  //   cout<<"--------------"<<endl;
  // }

  cout << best << endl;
}

Compilation message

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

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 10 ms 1780 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 312 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 308 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 312 KB Output is correct
21 Correct 0 ms 204 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 10 ms 1780 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 312 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 308 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 312 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 565 ms 32532 KB Output is correct
23 Correct 218 ms 32068 KB Output is correct
24 Correct 10 ms 1896 KB Output is correct
25 Correct 4 ms 836 KB Output is correct
26 Correct 4 ms 840 KB Output is correct
27 Correct 2 ms 452 KB Output is correct
28 Correct 147 ms 16272 KB Output is correct
29 Correct 42 ms 6340 KB Output is correct
30 Correct 90 ms 10180 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 320 KB Output is correct
33 Correct 281 ms 39332 KB Output is correct
34 Correct 242 ms 33804 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 21900 KB Output is correct
2 Correct 359 ms 50228 KB Output is correct
3 Correct 86 ms 17156 KB Output is correct
4 Correct 196 ms 32232 KB Output is correct
5 Correct 438 ms 37420 KB Output is correct
6 Correct 43 ms 8548 KB Output is correct
7 Correct 191 ms 37340 KB Output is correct
8 Correct 150 ms 31188 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 48 ms 8516 KB Output is correct
11 Correct 133 ms 25392 KB Output is correct
12 Correct 98 ms 16432 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 60 ms 7224 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 21900 KB Output is correct
2 Correct 359 ms 50228 KB Output is correct
3 Correct 86 ms 17156 KB Output is correct
4 Correct 196 ms 32232 KB Output is correct
5 Correct 438 ms 37420 KB Output is correct
6 Correct 43 ms 8548 KB Output is correct
7 Correct 191 ms 37340 KB Output is correct
8 Correct 150 ms 31188 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 48 ms 8516 KB Output is correct
11 Correct 133 ms 25392 KB Output is correct
12 Correct 98 ms 16432 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 60 ms 7224 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 10 ms 1780 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 312 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 308 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 308 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 1 ms 312 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 565 ms 32532 KB Output is correct
37 Correct 218 ms 32068 KB Output is correct
38 Correct 10 ms 1896 KB Output is correct
39 Correct 4 ms 836 KB Output is correct
40 Correct 4 ms 840 KB Output is correct
41 Correct 2 ms 452 KB Output is correct
42 Correct 147 ms 16272 KB Output is correct
43 Correct 42 ms 6340 KB Output is correct
44 Correct 90 ms 10180 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 320 KB Output is correct
47 Correct 281 ms 39332 KB Output is correct
48 Correct 242 ms 33804 KB Output is correct
49 Correct 177 ms 17864 KB Output is correct
50 Correct 168 ms 16748 KB Output is correct
51 Correct 218 ms 22324 KB Output is correct
52 Correct 251 ms 24508 KB Output is correct
53 Correct 69 ms 14260 KB Output is correct
54 Correct 280 ms 24476 KB Output is correct
55 Correct 381 ms 56732 KB Output is correct
56 Correct 220 ms 37656 KB Output is correct
57 Correct 278 ms 33212 KB Output is correct
58 Correct 103 ms 12996 KB Output is correct
59 Correct 336 ms 28384 KB Output is correct
60 Correct 260 ms 22924 KB Output is correct
61 Correct 248 ms 22028 KB Output is correct