Submission #531655

#	Time	Username	Problem	Language	Result	Execution time	Memory
531655		i_am_noob	Restore Array (RMI19_restore)	C++17	20 / 100	1079 ms	1044 KiB

restore

#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],par[maxn];
vector<vector<pii>> adj(maxn);
queue<int> q;
bool vis[maxn],vis2[maxn];

bool check(){
    memset(vis2,0,sizeof vis2);
    rep(n+2) if(!vis2[i]){
        int u=i;
        vis2[u]=1;
        bool flag=0;
        rep1(_,n+2){
            u=par[u];
            if(u==-1){
                flag=1;
                break;
            }
            vis2[u]=1;
        }
        if(!flag) return false;
    }
    return true;
}

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;
    rep(n+2) par[i]=-1;
    int de=0;
    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;
                par[v]=u;
                de++;
                if(de==n+2){
                    de=0;
                    if(!check()){
                        cout << "-1\n";
                        return;
                    }
                }
                if(vis[v]) continue;
                q.push(v);
                vis[v]=1;
            }
        }
        rep(n+2) bug(i,dis[i]);
    }
    if(!check()){
        cout << "-1\n";
        return;
    }
    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 (stderr)

restore.cpp: In function 'void orzck()':
restore.cpp:31:18: warning: statement has no effect [-Wunused-value]
   31 | #define bug(...) 777771449
      |                  ^~~~~~~~~
restore.cpp:72:13: note: in expansion of macro 'bug'
   72 |             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:76:13: note: in expansion of macro 'bug'
   76 |             bug(r+1,l,-(r-l+2-k));
      |             ^~~
restore.cpp:31:18: warning: statement has no effect [-Wunused-value]
   31 | #define bug(...) 777771449
      |                  ^~~~~~~~~
restore.cpp:105:18: note: in expansion of macro 'bug'
  105 |         rep(n+2) bug(i,dis[i]);
      |                  ^~~

• Subtask 1: 7 / 7
• Subtask 2: 13 / 13
• Subtask 3: 0 / 25
• Subtask 4: 0 / 55