oj.uz

답안 #272406

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
272406 2020-08-18T11:42:01 Z eohomegrownapps Restore Array (RMI19_restore) C++14
100 / 100
 394 ms 892 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n,m;
int INF = 1e9;

void relaxedges(){
    int a[20001], b[20001], c[20001];
    for (int i = 0; i<m; i++){
        int l,r,k,v;
        cin>>l>>r>>k>>v;
        r++;
        if (v==0){
            a[i]=l;
            b[i]=r;
            c[i]=k-(r-l);
        } else {
            a[i]=r;
            b[i]=l;
            c[i]=(r-l)-k+1;
        }
    }
    for (int i = 0; i<n; i++){
        a[m+2*i]=i;
        b[m+2*i]=i+1;
        c[m+2*i]=-1;
        a[m+2*i+1]=i+1;
        b[m+2*i+1]=i;
        c[m+2*i+1]=0;
    }
    m+=2*n;
    bool changed = true;
    bool works = true;
    int vals[20001];
    vals[0]=0;
    for (int i = 1; i<=n; i++){
        vals[i]=INF;
    }
    for (int i = 0; i<=n; i++){
        bool changed = false;
        for (int i = 0; i<m; i++){
            if (vals[b[i]]>vals[a[i]]-c[i]){
                vals[b[i]]=vals[a[i]]-c[i];
                changed=true;
            }
        }
        if (changed&&i==n){
            works=false;
        }
        //if (!changed){break;}
    }
    if (!works){
        cout<<-1<<'\n';
        return;
    }
    /*for (int i = 0; i<=n; i++){
        cout<<vals[i]<<' ';
    }cout<<'\n';*/
    for (int i = 0; i<n; i++){
        cout<<vals[i+1]-vals[i]<<' ';
    }cout<<'\n';
}


int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    cin>>n>>m;
    /*if (n<=18){
        subtask1();
    } else {*/
        relaxedges();
    //}
}

Compilation message

restore.cpp: In function 'void relaxedges()':
restore.cpp:33:10: warning: unused variable 'changed' [-Wunused-variable]
   33 |     bool changed = true;
      |          ^~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 164 ms 760 KB Output is correct
2 Correct 162 ms 768 KB Output is correct
3 Correct 217 ms 768 KB Output is correct
4 Correct 183 ms 768 KB Output is correct
5 Correct 374 ms 888 KB Output is correct
6 Correct 365 ms 772 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 164 ms 760 KB Output is correct
2 Correct 162 ms 768 KB Output is correct
3 Correct 217 ms 768 KB Output is correct
4 Correct 183 ms 768 KB Output is correct
5 Correct 374 ms 888 KB Output is correct
6 Correct 365 ms 772 KB Output is correct
7 Correct 185 ms 768 KB Output is correct
8 Correct 210 ms 768 KB Output is correct
9 Correct 178 ms 792 KB Output is correct
10 Correct 167 ms 768 KB Output is correct
11 Correct 383 ms 768 KB Output is correct
12 Correct 394 ms 788 KB Output is correct
13 Correct 164 ms 776 KB Output is correct
14 Correct 172 ms 768 KB Output is correct
15 Correct 196 ms 788 KB Output is correct
16 Correct 183 ms 792 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 416 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 164 ms 760 KB Output is correct
12 Correct 162 ms 768 KB Output is correct
13 Correct 217 ms 768 KB Output is correct
14 Correct 183 ms 768 KB Output is correct
15 Correct 374 ms 888 KB Output is correct
16 Correct 365 ms 772 KB Output is correct
17 Correct 185 ms 768 KB Output is correct
18 Correct 210 ms 768 KB Output is correct
19 Correct 178 ms 792 KB Output is correct
20 Correct 167 ms 768 KB Output is correct
21 Correct 383 ms 768 KB Output is correct
22 Correct 394 ms 788 KB Output is correct
23 Correct 164 ms 776 KB Output is correct
24 Correct 172 ms 768 KB Output is correct
25 Correct 196 ms 788 KB Output is correct
26 Correct 183 ms 792 KB Output is correct
27 Correct 180 ms 768 KB Output is correct
28 Correct 178 ms 768 KB Output is correct
29 Correct 165 ms 892 KB Output is correct
30 Correct 180 ms 768 KB Output is correct
31 Correct 159 ms 776 KB Output is correct
32 Correct 161 ms 892 KB Output is correct
33 Correct 363 ms 888 KB Output is correct
34 Correct 361 ms 892 KB Output is correct
35 Correct 162 ms 768 KB Output is correct
36 Correct 166 ms 888 KB Output is correct