oj.uz

답안 #793462

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
793462 2023-07-25T21:54:37 Z bLIC Restore Array (RMI19_restore) C++17
100 / 100
 334 ms 972 KB 
/**
 *  Author: Anil Byar
**/

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>

// using namespace __gnu_pbds;
using namespace std;

// template<class T>
// using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x).size()
#define uniq(v) v.erase(unique(all(v)), v.end())
#define ft first
#define sd second
#define pb push_back
#define eb emplace_back

// Source: https://codeforces.com/blog/entry/68809
// { start
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// } end


typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vl> vvl;

#define dbg if(0)

const ll MOD = 1e9+7;
const ll MOD9 = 998244353;
const ll INFLL = 1e18+5;
const int INF = 1e9;

void printbit(int x, int len) {string s="\n";while(len--){s=((x%2)?'1':'0')+s;x/=2;} cout<<s;}
ll power(ll x, ll y, ll mod){if (y==0) return 1;ll ret = power(x, y/2, mod);ret *= ret;ret%=mod;if (y&1) ret *= x;return ret%mod;}
ll modinv(ll x, ll mod = MOD) {return power(x, mod-2, mod);}

template<class T> bool chmin(T& a, T b){return (a>b?a=b,1:0);}
template<class T> bool chmax(T& a, T b){return (a<b?a=b,1:0);}
template<class T>
istream& operator>>(istream&in, vector<T>&v){
    for (T& x:v) in>>x;
    return in;
}
template<class T>
ostream& operator<<(ostream&out, vector<T>&v){
    for (T& x:v) out<<x<<' ';
    cout<<'\n';
    return out;
}
// use ?: with brackets (?:)
// check for overflow
// think about dp
// Read the statement carefully


void solve(){
    int n, m;cin>>n>>m;
    
    vector<array<int, 3>> edges;
    for (int i = 0;i<m;i++){
        int l, r, k, v;cin>>l>>r>>k>>v;
        if (v) edges.push_back({r+1, l, k - 1 - (r-l+1)});
        else edges.push_back({l, r+1, r-l+1-k});
    }
    for (int i = 1;i<=n;i++){
        edges.push_back({i-1, i, 1});// d[i] - d[i-1] <= 1, 
        edges.push_back({i, i-1, 0});// d[i] - d[i-1] >= 0, d[i-1] - d[i] <= 0
    }
    // debug(edges);
    vl dist(n+1);
    for (int i = 0;i<n;i++){
        for (auto x:edges){
            chmin(dist[x[1]], dist[x[0]] + x[2]);
        }
    }

    for (auto x:edges){
        if (chmin(dist[x[1]], dist[x[0]] + x[2])){
            cout<<-1;
            return;
        }
    }
    for (int i = 1;i<=n;i++) {
        if (dist[i]>dist[i-1]) {
            cout<<"1 ";
        }
        else cout<<"0 ";
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);


#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
    freopen("input.in", "r", stdin);
    freopen("output.out", "w", stdout);
    freopen("debug.dbg", "w", stderr);
    int tt = clock();
#endif

    int t=1, i = 1;
    // cin>>t;
    while(t--){
        // cout<<"Case #"<<i++<<": ";
        solve();
        cout<<'\n';
    }
#ifndef ONLINE_JUDGE
    cerr << "TIME = " << (float)(clock() - tt)/CLOCKS_PER_SEC << endl;
    tt = clock();
#endif
}

Compilation message

restore.cpp: In function 'int main()':
restore.cpp:147:14: warning: unused variable 'i' [-Wunused-variable]
  147 |     int t=1, i = 1;
      |              ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 232 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 320 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 788 KB Output is correct
2 Correct 105 ms 788 KB Output is correct
3 Correct 98 ms 768 KB Output is correct
4 Correct 98 ms 788 KB Output is correct
5 Correct 252 ms 916 KB Output is correct
6 Correct 245 ms 904 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 788 KB Output is correct
2 Correct 105 ms 788 KB Output is correct
3 Correct 98 ms 768 KB Output is correct
4 Correct 98 ms 788 KB Output is correct
5 Correct 252 ms 916 KB Output is correct
6 Correct 245 ms 904 KB Output is correct
7 Correct 107 ms 916 KB Output is correct
8 Correct 103 ms 908 KB Output is correct
9 Correct 101 ms 916 KB Output is correct
10 Correct 104 ms 908 KB Output is correct
11 Correct 323 ms 916 KB Output is correct
12 Correct 334 ms 916 KB Output is correct
13 Correct 98 ms 916 KB Output is correct
14 Correct 103 ms 916 KB Output is correct
15 Correct 105 ms 916 KB Output is correct
16 Correct 123 ms 916 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 232 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 320 KB Output is correct
11 Correct 97 ms 788 KB Output is correct
12 Correct 105 ms 788 KB Output is correct
13 Correct 98 ms 768 KB Output is correct
14 Correct 98 ms 788 KB Output is correct
15 Correct 252 ms 916 KB Output is correct
16 Correct 245 ms 904 KB Output is correct
17 Correct 107 ms 916 KB Output is correct
18 Correct 103 ms 908 KB Output is correct
19 Correct 101 ms 916 KB Output is correct
20 Correct 104 ms 908 KB Output is correct
21 Correct 323 ms 916 KB Output is correct
22 Correct 334 ms 916 KB Output is correct
23 Correct 98 ms 916 KB Output is correct
24 Correct 103 ms 916 KB Output is correct
25 Correct 105 ms 916 KB Output is correct
26 Correct 123 ms 916 KB Output is correct
27 Correct 105 ms 916 KB Output is correct
28 Correct 116 ms 908 KB Output is correct
29 Correct 111 ms 916 KB Output is correct
30 Correct 101 ms 916 KB Output is correct
31 Correct 96 ms 908 KB Output is correct
32 Correct 103 ms 916 KB Output is correct
33 Correct 270 ms 916 KB Output is correct
34 Correct 301 ms 972 KB Output is correct
35 Correct 109 ms 916 KB Output is correct
36 Correct 120 ms 916 KB Output is correct