oj.uz

Submission #210688

# Submission time Handle Problem Language Result Execution time Memory
210688 2020-03-18T02:40:04 Z thebes Restore Array (RMI19_restore) C++14
100 / 100
 528 ms 1016 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,ssse3,sse3,sse4,popcnt,avx,mmx,abm,tune=native")
#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>N+1){
            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:56: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:57: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 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 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
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 808 KB Output is correct
2 Correct 246 ms 808 KB Output is correct
3 Correct 10 ms 760 KB Output is correct
4 Correct 273 ms 760 KB Output is correct
5 Correct 477 ms 760 KB Output is correct
6 Correct 467 ms 760 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 808 KB Output is correct
2 Correct 246 ms 808 KB Output is correct
3 Correct 10 ms 760 KB Output is correct
4 Correct 273 ms 760 KB Output is correct
5 Correct 477 ms 760 KB Output is correct
6 Correct 467 ms 760 KB Output is correct
7 Correct 97 ms 760 KB Output is correct
8 Correct 103 ms 760 KB Output is correct
9 Correct 91 ms 760 KB Output is correct
10 Correct 118 ms 760 KB Output is correct
11 Correct 528 ms 760 KB Output is correct
12 Correct 528 ms 760 KB Output is correct
13 Correct 97 ms 760 KB Output is correct
14 Correct 30 ms 760 KB Output is correct
15 Correct 57 ms 764 KB Output is correct
16 Correct 225 ms 888 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 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 162 ms 808 KB Output is correct
12 Correct 246 ms 808 KB Output is correct
13 Correct 10 ms 760 KB Output is correct
14 Correct 273 ms 760 KB Output is correct
15 Correct 477 ms 760 KB Output is correct
16 Correct 467 ms 760 KB Output is correct
17 Correct 97 ms 760 KB Output is correct
18 Correct 103 ms 760 KB Output is correct
19 Correct 91 ms 760 KB Output is correct
20 Correct 118 ms 760 KB Output is correct
21 Correct 528 ms 760 KB Output is correct
22 Correct 528 ms 760 KB Output is correct
23 Correct 97 ms 760 KB Output is correct
24 Correct 30 ms 760 KB Output is correct
25 Correct 57 ms 764 KB Output is correct
26 Correct 225 ms 888 KB Output is correct
27 Correct 17 ms 888 KB Output is correct
28 Correct 16 ms 888 KB Output is correct
29 Correct 20 ms 888 KB Output is correct
30 Correct 18 ms 1016 KB Output is correct
31 Correct 14 ms 888 KB Output is correct
32 Correct 14 ms 888 KB Output is correct
33 Correct 523 ms 888 KB Output is correct
34 Correct 508 ms 888 KB Output is correct
35 Correct 17 ms 1016 KB Output is correct
36 Correct 16 ms 936 KB Output is correct