oj.uz

Submission #335764

# Submission time Handle Problem Language Result Execution time Memory
335764 2020-12-13T23:09:53 Z NaimSS Restore Array (RMI19_restore) C++14
100 / 100
 93 ms 1132 KB 
#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
//#define int long long  
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
#define left oooooopss
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll b,ll e,ll m){
  b%=m;
  ll ans = 1;
  for (; e; b = b * b % m, e /= 2)
      if (e & 1) ans = ans * b % m;
  return ans;
}
const int N = 5050;
vector<pii> g[N];
int dist[N];
int inQ[N];
int visi[N];
int n,m;
const int inf = 1e9;
void NO(){
  cout << -1 << endl;
  exit(0);
}
void SPFA(int S){
  for(int i=0;i<N;i++)dist[i]=inf,inQ[i]=visi[i]=0;
  queue<int> q;
  q.push(S);
  inQ[S]=1;
  dist[S]=0;
  while(!q.empty()){
    int cur = q.front();
    q.pop();
    inQ[cur]=0;
    for(auto to : g[cur]){
      if(dist[to.ff] > dist[cur] + to.ss){
        if(visi[to.ff] > 2*m)
          NO();
        visi[to.ff]++;
        dist[to.ff] = dist[cur] + to.ss;
        if(dist[to.ff] < 0){
          NO();
        }
        if(!inQ[to.ff]){
          q.push(to.ff);
          inQ[to.ff]=1;
        }
      }
    }
  }
  for(int i=0;i<N;i++)if(dist[i]<0)NO();
}

int32_t main(){
  fastio;
  cin >> n >> m;
  for(int i=0;i<m;i++){
    int l,r,k,v;
    cin >> l >> r >> k >> v;
    l++;
    r++;
    if(v == 0){ // xl-1 - xr <= -k
      g[r].pb(pii(l-1,-k));
    }else{ 
      // xr - xl-1 < k 0's
      // xr - xl-1 <= k-1
      g[l-1].pb(pii(r,k-1));
    }
  }
  for(int i=1;i<=n;i++){
    g[i-1].pb(pii(i,1));
    g[i].pb(pii(i-1,0));
  }
  SPFA(0);
  for(int i=1;i<=n;i++){
    cout << ((dist[i] - dist[i-1])^1) << " ";
  }
  cout << endl;

  // math -> gcd it all
  // Did u check N=1? Did you switch N,M?
}

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 876 KB Output is correct
2 Correct 6 ms 876 KB Output is correct
3 Correct 5 ms 876 KB Output is correct
4 Correct 5 ms 876 KB Output is correct
5 Correct 5 ms 1004 KB Output is correct
6 Correct 5 ms 1004 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 876 KB Output is correct
2 Correct 6 ms 876 KB Output is correct
3 Correct 5 ms 876 KB Output is correct
4 Correct 5 ms 876 KB Output is correct
5 Correct 5 ms 1004 KB Output is correct
6 Correct 5 ms 1004 KB Output is correct
7 Correct 13 ms 1004 KB Output is correct
8 Correct 13 ms 1004 KB Output is correct
9 Correct 12 ms 1004 KB Output is correct
10 Correct 20 ms 1044 KB Output is correct
11 Correct 6 ms 1004 KB Output is correct
12 Correct 5 ms 1004 KB Output is correct
13 Correct 13 ms 1004 KB Output is correct
14 Correct 29 ms 1004 KB Output is correct
15 Correct 84 ms 1004 KB Output is correct
16 Correct 93 ms 1004 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 5 ms 876 KB Output is correct
12 Correct 6 ms 876 KB Output is correct
13 Correct 5 ms 876 KB Output is correct
14 Correct 5 ms 876 KB Output is correct
15 Correct 5 ms 1004 KB Output is correct
16 Correct 5 ms 1004 KB Output is correct
17 Correct 13 ms 1004 KB Output is correct
18 Correct 13 ms 1004 KB Output is correct
19 Correct 12 ms 1004 KB Output is correct
20 Correct 20 ms 1044 KB Output is correct
21 Correct 6 ms 1004 KB Output is correct
22 Correct 5 ms 1004 KB Output is correct
23 Correct 13 ms 1004 KB Output is correct
24 Correct 29 ms 1004 KB Output is correct
25 Correct 84 ms 1004 KB Output is correct
26 Correct 93 ms 1004 KB Output is correct
27 Correct 8 ms 1132 KB Output is correct
28 Correct 9 ms 1004 KB Output is correct
29 Correct 7 ms 1004 KB Output is correct
30 Correct 8 ms 1004 KB Output is correct
31 Correct 8 ms 1004 KB Output is correct
32 Correct 8 ms 1004 KB Output is correct
33 Correct 5 ms 1004 KB Output is correct
34 Correct 5 ms 1004 KB Output is correct
35 Correct 9 ms 1024 KB Output is correct
36 Correct 8 ms 1132 KB Output is correct