oj.uz

Submission #210686

# Submission time Handle Problem Language Result Execution time Memory
210686 2020-03-18T02:38:05 Z thebes Restore Array (RMI19_restore) C++14
7 / 100
 600 ms 888 KB 
#include <bits/stdc++.h>
#define DEBUG 1
using namespace std;

namespace output{
    void __(short x){cout<<x;}
    void __(unsigned x){cout<<x;}
    void __(int x){cout<<x;}
    void __(long long x){cout<<x;}
    void __(unsigned long long x){cout<<x;}
    void __(double x){cout<<x;}
    void __(long double x){cout<<x;}
    void __(char x){cout<<x;}
    void __(const char*x){cout<<x;}
    void __(const string&x){cout<<x;}
    void __(bool x){cout<<(x?"true":"false");}
    template<class S,class T>
    void __(const pair<S,T>&x){__(DEBUG?"(":""),__(x.first),__(DEBUG?", ":" "),__(x.second),__(DEBUG?")":"");}
    template<class T>
    void __(const vector<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class T>
    void __(const set<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class T>
    void __(const multiset<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class S,class T>
    void __(const map<S,T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    void pr(){cout<<"\n";}
    template<class S,class... T>
    void pr(const S&a,const T&...b){__(a);if(sizeof...(b))__(' ');pr(b...);}
}

using namespace output;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,char> pic;
typedef pair<double,double> pdd;
typedef pair<ld,ld> pld;
typedef vector<int> vi;
typedef vector<ll> vl;

#define pb push_back
#define fox(i,x,y) for(int i=(x);i<=(y);i++)
#define foxr(i,x,y) for(int i=(y);i>=(x);i--)

const int MN = 5555;
int N, M, i, x, y, k, t, arr[MN], st[MN], dn, cnt;
vector<pii> adj[MN];

int main(){
    for(scanf("%d%d",&N,&M),i=1;i<=M;i++){
        scanf("%d%d%d%d",&x,&y,&k,&t); y++;
        if(t) adj[y].pb({x,x-y+k-1});
        else adj[x].pb({y,y-x-k});
    }
    for(i=1;i<=N;i++){
        adj[i-1].pb({i,1});
        adj[i].pb({i-1,0});
    }
    while(1){
        cnt ++;
        if(cnt>MN){
            printf("-1\n");
            return 0;
        }
        dn = 1;
        for(i=0;i<=N;i++){
            for(auto v : adj[i]){
                if(arr[v.first]-arr[i]>v.second){
                    arr[v.first]=arr[i]+v.second;
                    dn = 0;
                }
            }
        }
        if(dn) break;
    }
    for(i=1;i<=N;i++)
        printf("%d ",arr[i]-arr[i-1]);
    printf("\n");
    return 0;
}

Compilation message

restore.cpp: In function 'int main()':
restore.cpp:53:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(scanf("%d%d",&N,&M),i=1;i<=M;i++){
         ~~~~~~~~~~~~~~~~~~~^~~~
restore.cpp:54:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d%d",&x,&y,&k,&t); y++;
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 7 ms 504 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 376 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 888 KB Output is correct
2 Correct 262 ms 760 KB Output is correct
3 Correct 9 ms 760 KB Output is correct
4 Correct 295 ms 812 KB Output is correct
5 Execution timed out 706 ms 832 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 888 KB Output is correct
2 Correct 262 ms 760 KB Output is correct
3 Correct 9 ms 760 KB Output is correct
4 Correct 295 ms 812 KB Output is correct
5 Execution timed out 706 ms 832 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 7 ms 504 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 168 ms 888 KB Output is correct
12 Correct 262 ms 760 KB Output is correct
13 Correct 9 ms 760 KB Output is correct
14 Correct 295 ms 812 KB Output is correct
15 Execution timed out 706 ms 832 KB Time limit exceeded
16 Halted 0 ms 0 KB -