oj.uz

Submission #493956

# Submission time Handle Problem Language Result Execution time Memory
493956 2021-12-13T13:18:52 Z leaked Restore Array (RMI19_restore) C++14
20 / 100
 591 ms 792 KB 
#include <bits/stdc++.h>

#define f first
#define s second
#define m_p make_pair
#define vec vector
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fast_rmi ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;

signed main(){
    fast_rmi;
    int n,m;
    cin>>n>>m;
    vec<array<int,4>>arr(m);
    vec<array<int,4>>arrt(m);

    for(auto &z : arr){
        cin>>z[0]>>z[1]>>z[2]>>z[3];
        if(z[3]==1)
            z[2]=z[2]-1;
//        cout<<"L R "<<z[0]<<' '<<z[1]<<' '<<z[2]<<' '<<"TYPE "<<z[3]<<endl;
    }
     auto brute=[&](){
        for(int mask=0;mask<(1<<n);mask++){
            vec<int>a(n);
            for(int i=0;i<n;i++){
                if(mask&(1<<i))
                    a[i]=1;
                else
                    a[i]=0;
            }
            auto check=[&](){
                int ok=1;
                for(auto &z : arr){
                    int cnt=0;
                    for(int i=z[0];i<=z[1];i++)
                        cnt+=(!a[i]);
                    if(z[3])
                        ok&=(cnt<=z[2]);
                    else{
                        ok&=(cnt>=z[2]);
                    }
                }
                return ok;
            };
            if(check()){
                return a;
            }
        }
        return vec<int>();
    };
    if(n<=18){
        vec<int> ans=brute();
        if(!sz(ans)){
            cout<<-1;
            return 0;
        }
        for(auto &z : ans)
            cout<<z<<' ';
        return 0;
    }
    arrt=arr;
    vec<int> a(n,1);
    for(int i=0;i<n;i++){
        int ok=1;
        int nd=0;
        for(auto &z : arr){
            if(z[0]<=i&&z[1]>=i){
//                cout<<"ALOGG "<<z[0]<<' '<<z[1]<<endl;
                if(z[3]==0 && z[2]){
                    nd=1;
//                    cout<<"NEED "<<z[0]<<' '<<z[1]<<' '<<z[2]<<endl;
                }
                if(z[3]==1 && !z[2]){
                    ok=0;
//                    cout<<"CHE "<<z[0]<<' '<<z[1]<<endl;
                }
            }
        }
        if(nd && ok){
            a[i]=0;
//            cout<<"Y "<<i<<endl;
            for(auto &z : arr){
                if(z[0]<=i&&z[1]>=i){
                    z[2]=max(0,z[2]-1);
                }
            }
        }
    }
    auto check=[&](){
        int ok=1;
        for(auto &z : arrt){
            int cnt=0;
            for(int i=z[0];i<=z[1];i++)
                cnt+=(!a[i]);
            if(z[3])
                assert(cnt<=z[2]);
            else{
                ok&=(cnt>=z[2]);
            }
        }
        return ok;
    };
    if(!check()){
        cout<<-1;
    }
    else
        for(auto &z : a)
            cout<<z<<' ';
    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 133 ms 204 KB Output is correct
4 Correct 105 ms 204 KB Output is correct
5 Correct 591 ms 300 KB Output is correct
6 Correct 227 ms 312 KB Output is correct
7 Correct 79 ms 204 KB Output is correct
8 Correct 78 ms 296 KB Output is correct
9 Correct 524 ms 316 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 736 KB Output is correct
2 Correct 324 ms 760 KB Output is correct
3 Correct 310 ms 736 KB Output is correct
4 Correct 333 ms 760 KB Output is correct
5 Correct 183 ms 748 KB Output is correct
6 Correct 160 ms 728 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 736 KB Output is correct
2 Correct 324 ms 760 KB Output is correct
3 Correct 310 ms 736 KB Output is correct
4 Correct 333 ms 760 KB Output is correct
5 Correct 183 ms 748 KB Output is correct
6 Correct 160 ms 728 KB Output is correct
7 Correct 338 ms 784 KB Output is correct
8 Correct 338 ms 780 KB Output is correct
9 Correct 314 ms 716 KB Output is correct
10 Correct 300 ms 756 KB Output is correct
11 Correct 180 ms 768 KB Output is correct
12 Correct 178 ms 716 KB Output is correct
13 Correct 295 ms 744 KB Output is correct
14 Correct 184 ms 792 KB Output is correct
15 Incorrect 173 ms 716 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 133 ms 204 KB Output is correct
4 Correct 105 ms 204 KB Output is correct
5 Correct 591 ms 300 KB Output is correct
6 Correct 227 ms 312 KB Output is correct
7 Correct 79 ms 204 KB Output is correct
8 Correct 78 ms 296 KB Output is correct
9 Correct 524 ms 316 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 306 ms 736 KB Output is correct
12 Correct 324 ms 760 KB Output is correct
13 Correct 310 ms 736 KB Output is correct
14 Correct 333 ms 760 KB Output is correct
15 Correct 183 ms 748 KB Output is correct
16 Correct 160 ms 728 KB Output is correct
17 Correct 338 ms 784 KB Output is correct
18 Correct 338 ms 780 KB Output is correct
19 Correct 314 ms 716 KB Output is correct
20 Correct 300 ms 756 KB Output is correct
21 Correct 180 ms 768 KB Output is correct
22 Correct 178 ms 716 KB Output is correct
23 Correct 295 ms 744 KB Output is correct
24 Correct 184 ms 792 KB Output is correct
25 Incorrect 173 ms 716 KB Output isn't correct
26 Halted 0 ms 0 KB -