oj.uz

Submission #531640

# Submission time Handle Problem Language Result Execution time Memory
531640 2022-03-01T07:40:30 Z i_am_noob Restore Array (RMI19_restore) C++17
20 / 100
 600 ms 972 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")

#define ll long long
//#define int ll
#define ull unsigned ll
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b); i>=((int)(a)); i--)
#define chkmin(a,b) (a=min(a,b))
#define chkmax(a,b) (a=max(a,b))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pb push_back
#define inf 1010000000
//#define inf 4000000000000000000
#define eps 1e-9
#define sz(a) ((int)a.size())
#define pow2(x) (1ll<<(x))
#define ceiling(a,b) (((a)+(b)-1)/(b))
#define print0(a) cout << (a) << ' '
#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
#else
#define bug(...) 777771449
#endif

const int mod=1000000007;
const int maxn=5005,maxm=5,maxk=7777714;

//i_am_noob
int n,m,dis[maxn],curlen[maxn];
vector<vector<pii>> adj(maxn);
queue<int> q;
bool vis[maxn];

void orzck(){
    cin >> n >> m;
    rep(n) adj[i].pb({i+1,1}),adj[i+1].pb({i,0});
    rep(n+1) adj[n+1].pb({i,0});
    rep(n+2) dis[i]=inf;
    rep(m){
        int l,r,k,x;
        cin >> l >> r >> k >> x;
        if(x==0){
            adj[l].pb({r+1,r+1-l-k});
            bug(l,r+1,r+1-l-k);
        }
        else{
            adj[r+1].pb({l,-(r-l+2-k)});
            bug(r+1,l,-(r-l+2-k));
        }
    }
    q.push(n+1);
    dis[n+1]=0;
    vis[n+1]=1;
    memset(curlen,0,sizeof curlen);
    while(!q.empty()){
        int u=q.front();
        q.pop();
        vis[u]=0;
        for(auto [v,w]: adj[u]){
            if(dis[u]+w<dis[v]){
                dis[v]=dis[u]+w;
                curlen[v]=curlen[u]+1;
                if(curlen[v]==n){
                    cout << "-1\n";
                    return;
                }
                if(vis[v]) continue;
                q.push(v);
                vis[v]=1;
            }
        }
    }
    rep(n) cout << dis[i+1]-dis[i] << ' ';
    cout << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    orzck();
    return 0;
}

Compilation message

restore.cpp: In function 'void orzck()':
restore.cpp:31:18: warning: statement has no effect [-Wunused-value]
   31 | #define bug(...) 777771449
      |                  ^~~~~~~~~
restore.cpp:53:13: note: in expansion of macro 'bug'
   53 |             bug(l,r+1,r+1-l-k);
      |             ^~~
restore.cpp:31:18: warning: statement has no effect [-Wunused-value]
   31 | #define bug(...) 777771449
      |                  ^~~~~~~~~
restore.cpp:57:13: note: in expansion of macro 'bug'
   57 |             bug(r+1,l,-(r-l+2-k));
      |             ^~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 844 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 4 ms 844 KB Output is correct
4 Correct 7 ms 844 KB Output is correct
5 Correct 367 ms 860 KB Output is correct
6 Correct 375 ms 880 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 844 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 4 ms 844 KB Output is correct
4 Correct 7 ms 844 KB Output is correct
5 Correct 367 ms 860 KB Output is correct
6 Correct 375 ms 880 KB Output is correct
7 Correct 10 ms 844 KB Output is correct
8 Correct 10 ms 860 KB Output is correct
9 Correct 15 ms 888 KB Output is correct
10 Correct 20 ms 972 KB Output is correct
11 Execution timed out 1020 ms 868 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 5 ms 844 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 4 ms 844 KB Output is correct
14 Correct 7 ms 844 KB Output is correct
15 Correct 367 ms 860 KB Output is correct
16 Correct 375 ms 880 KB Output is correct
17 Correct 10 ms 844 KB Output is correct
18 Correct 10 ms 860 KB Output is correct
19 Correct 15 ms 888 KB Output is correct
20 Correct 20 ms 972 KB Output is correct
21 Execution timed out 1020 ms 868 KB Time limit exceeded
22 Halted 0 ms 0 KB -