oj.uz

Submission #461325

# Submission time Handle Problem Language Result Execution time Memory
461325 2021-08-09T19:05:30 Z idas Cheap flights (LMIO18_pigus_skrydziai) C++11
16 / 100
 1041 ms 90256 KB 
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i = (begin); i < (end); i++)
#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define SZ(x) ((int)((x).size()))
#define LE(vec) vec[vec.size()-1]
#define TSTS int t; cin >> t; while(t--)solve()

const int INF = 1e9;
const long long LINF = 1e18;
const long double PI = asin(1)*2;
const int MOD = 1e9+7;

using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef map<int, int> mii;
typedef long long ll;
typedef long double ld;

void setIO()
{
    FAST_IO;
}

void setIO (string s)
 {
    setIO();
 	freopen((s+".in").c_str(),"r",stdin);
 	freopen((s+".out").c_str(),"w",stdout);
}

const int N=3e5+10, M=5e5+10;

int n, m;
ll cn[N], ans;
map<pii, ll> con;
set<pii, greater<pii>> ad[N];

int main()
{
    setIO();
    cin >> n >> m;
    FOR(i, 0, m)
    {
        int a, b; ll c;
        cin >> a >> b >> c;
        cn[a-1]+=c;
        cn[b-1]+=c;
        ad[a-1].insert({c, b-1});
        ad[b-1].insert({c, a-1});
        con[{min(a-1, b-1), max(a-1, b-1)}]=c;
    }

    FOR(i, 0, n) ans=max(ans, cn[i]);

    FOR(i, 0, n)
    {
        int in=2;
        int k=-1, b=-1;
        for(auto[x, y] : ad[i]){
            if(in){
                if(in==2){
                    k=y;
                }
                else{
                    b=y;
                }
                in--;
            }
            else break;
        }

        ll val=con[{min(i, k), max(i, k)}]+
        con[{min(i, b), max(i, b-1)}]+
        con[{min(k, b), max(k, b)}];
        ans=max(ans, val);
    }

    cout << ans;
}

Compilation message

pigus_skrydziai.cpp: In function 'int main()':
pigus_skrydziai.cpp:64:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   64 |         for(auto[x, y] : ad[i]){
      |                 ^
pigus_skrydziai.cpp: In function 'void setIO(std::string)':
pigus_skrydziai.cpp:32:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |   freopen((s+".in").c_str(),"r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pigus_skrydziai.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   freopen((s+".out").c_str(),"w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 8 ms 14416 KB Output is correct
4 Correct 8 ms 14412 KB Output is correct
5 Correct 10 ms 14308 KB Output is correct
6 Correct 28 ms 17684 KB Output is correct
7 Correct 8 ms 14412 KB Output is correct
8 Correct 8 ms 14284 KB Output is correct
9 Correct 8 ms 14412 KB Output is correct
10 Incorrect 9 ms 14412 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 8 ms 14416 KB Output is correct
4 Correct 8 ms 14412 KB Output is correct
5 Correct 10 ms 14308 KB Output is correct
6 Correct 28 ms 17684 KB Output is correct
7 Correct 8 ms 14412 KB Output is correct
8 Correct 8 ms 14284 KB Output is correct
9 Correct 8 ms 14412 KB Output is correct
10 Incorrect 9 ms 14412 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 442 ms 61168 KB Output is correct
2 Correct 679 ms 90256 KB Output is correct
3 Correct 193 ms 39748 KB Output is correct
4 Correct 396 ms 63160 KB Output is correct
5 Correct 1041 ms 86648 KB Output is correct
6 Correct 134 ms 35012 KB Output is correct
7 Correct 283 ms 72756 KB Output is correct
8 Correct 297 ms 74436 KB Output is correct
9 Correct 118 ms 35600 KB Output is correct
10 Correct 137 ms 35132 KB Output is correct
11 Correct 358 ms 65592 KB Output is correct
12 Correct 297 ms 55900 KB Output is correct
13 Correct 10 ms 14316 KB Output is correct
14 Correct 183 ms 31244 KB Output is correct

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 442 ms 61168 KB Output is correct
2 Correct 679 ms 90256 KB Output is correct
3 Correct 193 ms 39748 KB Output is correct
4 Correct 396 ms 63160 KB Output is correct
5 Correct 1041 ms 86648 KB Output is correct
6 Correct 134 ms 35012 KB Output is correct
7 Correct 283 ms 72756 KB Output is correct
8 Correct 297 ms 74436 KB Output is correct
9 Correct 118 ms 35600 KB Output is correct
10 Correct 137 ms 35132 KB Output is correct
11 Correct 358 ms 65592 KB Output is correct
12 Correct 297 ms 55900 KB Output is correct
13 Correct 10 ms 14316 KB Output is correct
14 Correct 183 ms 31244 KB Output is correct
15 Correct 8 ms 14412 KB Output is correct
16 Correct 8 ms 14412 KB Output is correct
17 Correct 8 ms 14416 KB Output is correct
18 Correct 8 ms 14412 KB Output is correct
19 Correct 10 ms 14308 KB Output is correct
20 Correct 28 ms 17684 KB Output is correct
21 Correct 8 ms 14412 KB Output is correct
22 Correct 8 ms 14284 KB Output is correct
23 Correct 8 ms 14412 KB Output is correct
24 Incorrect 9 ms 14412 KB Output isn't correct
25 Halted 0 ms 0 KB -