oj.uz

답안 #442026

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
442026 2021-07-06T19:27:18 Z JovanB Restore Array (RMI19_restore) C++17
7 / 100
 600 ms 908 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;

const int MAXN = 5000;

int dist[MAXN+5];

const int INF = 1000000;

int main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
    cout.precision(10);
    cout << fixed;

    int n, m;
    cin >> n >> m;
    vector <tuple <int, int, int>> edges;
    for(int i=1; i<=m; i++){
        int l, r, k, val;
        cin >> l >> r >> k >> val;
        l++;
        r++;
        if(val == 1) edges.push_back({l-1, r, k-1});
        else edges.push_back({r, l-1, -k});
    }
    for(int i=1; i<=n; i++){
        edges.push_back({i-1, i, 1});
        edges.push_back({i, i-1, 0});
    }
    for(int i=1; i<=n; i++) dist[i] = INF;
    for(int k=0; k<n; k++){
        for(auto x : edges){
            int a = get<0>(x);
            int b = get<1>(x);
            int c = get<2>(x);
            if(dist[a] != INF && dist[b] > dist[a] + c) dist[b] = dist[a] + c;
        }
    }
    for(auto x : edges){
        int a = get<0>(x);
            int b = get<1>(x);
            int c = get<2>(x);
            if(dist[a] != INF && dist[b] > dist[a] + c){
                cout << "-1\n";
                return 0;
            }
    }
    for(int i=1; i<=n; i++){
        if(dist[i] != dist[i-1]) cout << "0 ";
        else cout << "1 ";
    }
    cout << "\n";
    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 908 KB Output is correct
2 Correct 162 ms 908 KB Output is correct
3 Correct 155 ms 908 KB Output is correct
4 Correct 157 ms 908 KB Output is correct
5 Execution timed out 634 ms 908 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 908 KB Output is correct
2 Correct 162 ms 908 KB Output is correct
3 Correct 155 ms 908 KB Output is correct
4 Correct 157 ms 908 KB Output is correct
5 Execution timed out 634 ms 908 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 157 ms 908 KB Output is correct
12 Correct 162 ms 908 KB Output is correct
13 Correct 155 ms 908 KB Output is correct
14 Correct 157 ms 908 KB Output is correct
15 Execution timed out 634 ms 908 KB Time limit exceeded
16 Halted 0 ms 0 KB -