oj.uz

Submission #696338

# Submission time Handle Problem Language Result Execution time Memory
696338 2023-02-06T09:13:51 Z Cross_Ratio Travelling Merchant (CCO21_day2problem1) C++14
4 / 25
 2000 ms 15180 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e18;
vector<array<int, 3>> adj[200005];
int DP[200005][2];
signed main() {
    cin.sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int N, M;
    cin >> N >> M;
    int i, j;
    for(i=0;i<M;i++) {
        int a, b, r, p;
        cin >> a >> b >> r >> p;
        adj[b-1].push_back({a-1, r, p});
    }
    int cnt = 1;
    while(true) {
        for(i=0;i<N;i++) DP[i][cnt%2] = INF;
        for(i=0;i<N;i++) {
            for(auto n2 : adj[i]) {
                DP[n2[0]][cnt%2] = min(DP[n2[0]][cnt%2], max(n2[1], DP[i][(cnt+1)%2] - n2[2]));
            }
        }
        bool isSame = true;
        for(i=0;i<N;i++) {
            if(DP[i][cnt%2] != DP[i][(cnt+1)%2]) isSame = false;
        }
        if(isSame) break;
        cnt++;
    }
    for(i=0;i<N;i++) {
        cout << (DP[i][cnt%2] >= 1e12 ? -1 : DP[i][cnt%2]) << ' ';
    }

}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:13:12: warning: unused variable 'j' [-Wunused-variable]
   13 |     int i, j;
      |            ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5076 KB Output is correct
2 Correct 4 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 44 ms 5100 KB Output is correct
9 Correct 5 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 5 ms 5076 KB Output is correct
12 Correct 3 ms 5036 KB Output is correct
13 Correct 3 ms 5040 KB Output is correct
14 Correct 42 ms 5160 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1349 ms 15128 KB Output is correct
2 Correct 1272 ms 15180 KB Output is correct
3 Correct 65 ms 12280 KB Output is correct
4 Correct 26 ms 9072 KB Output is correct
5 Correct 225 ms 13992 KB Output is correct
6 Correct 244 ms 14028 KB Output is correct
7 Correct 86 ms 11680 KB Output is correct
8 Execution timed out 2041 ms 14284 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5076 KB Output is correct
2 Correct 4 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 44 ms 5100 KB Output is correct
9 Correct 5 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 5 ms 5076 KB Output is correct
12 Correct 3 ms 5036 KB Output is correct
13 Correct 3 ms 5040 KB Output is correct
14 Correct 42 ms 5160 KB Output is correct
15 Correct 1349 ms 15128 KB Output is correct
16 Correct 1272 ms 15180 KB Output is correct
17 Correct 65 ms 12280 KB Output is correct
18 Correct 26 ms 9072 KB Output is correct
19 Correct 225 ms 13992 KB Output is correct
20 Correct 244 ms 14028 KB Output is correct
21 Correct 86 ms 11680 KB Output is correct
22 Execution timed out 2041 ms 14284 KB Time limit exceeded
23 Halted 0 ms 0 KB -