oj.uz

Submission #499879

# Submission time Handle Problem Language Result Execution time Memory
499879 2021-12-29T21:42:07 Z Jaguar Cheap flights (LMIO18_pigus_skrydziai) C++14
0 / 100
 3000 ms 4196 KB 
#include <bits/stdc++.h>
using namespace std;
struct keliai{
    int start;
    int end;
    int profit;
};
int main()
{
    int n, m, maks=0;
    cin >> n >> m;
    keliai kelias[m];
    for (int i=0;i<m;i++){
        cin >> kelias[i].start >> kelias[i].end >> kelias[i].profit;
    }
    for (int j=0;j<n;j++){
        int tmaks=0;
        for (int i=0;i<m;i++){
            if(j==kelias[i].start||j==kelias[i].end)tmaks+=kelias[i].profit;
        }
        maks=max(tmaks, maks);
    }
    cout << maks;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 268 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 268 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3014 ms 4196 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3014 ms 4196 KB Time limit exceeded
2 Halted 0 ms 0 KB -