oj.uz

Submission #493905

# Submission time Handle Problem Language Result Execution time Memory
493905 2021-12-13T10:42:18 Z leaked Restore Array (RMI19_restore) C++14
7 / 100
 484 ms 984 KB 
#include <bits/stdc++.h>

#define f first
#define s second
#define m_p make_pair
#define vec vector
#define pb push_back
#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);

//#pragma GCC optimize("Ofast")

using namespace std;
typedef pair<int,int> pii;
const int N=5e3+1;
vec<int> g[2*N],gr[2*N];
void add_edge(int v,int u,int x,int y){
    if(x)
        v+=N;
    if(y)
        u+=N;
    g[v].pb(u);
    gr[u].pb(v);
}
bool u[2*N];
int c[2*N],tt=1;
vec<int>ord;
void dfs1(int v){
    u[v]=1;
    for(auto &z :g[v]){
        if(!u[z])
            dfs1(z);
    }
    ord.pb(v);
}
void dfs2(int v){
    c[v]=tt;
    for(auto &z : gr[v]){
        if(!c[z])
            dfs2(z);
    }
}
signed main(){
    fast_rmi;
    int n,m;
    cin>>n>>m;
    vec<array<int,4>>arr(m);
    for(auto &z : arr){
        cin>>z[0]>>z[1]>>z[2]>>z[3];
        if(z[3]==1)
            z[2]=z[2]-1;
    }
    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;
    }
    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 1 ms 716 KB Output is correct
3 Correct 112 ms 768 KB Output is correct
4 Correct 77 ms 788 KB Output is correct
5 Correct 484 ms 776 KB Output is correct
6 Correct 175 ms 776 KB Output is correct
7 Correct 74 ms 836 KB Output is correct
8 Correct 62 ms 772 KB Output is correct
9 Correct 366 ms 772 KB Output is correct
10 Correct 1 ms 788 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 984 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 984 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 1 ms 716 KB Output is correct
3 Correct 112 ms 768 KB Output is correct
4 Correct 77 ms 788 KB Output is correct
5 Correct 484 ms 776 KB Output is correct
6 Correct 175 ms 776 KB Output is correct
7 Correct 74 ms 836 KB Output is correct
8 Correct 62 ms 772 KB Output is correct
9 Correct 366 ms 772 KB Output is correct
10 Correct 1 ms 788 KB Output is correct
11 Incorrect 3 ms 984 KB Unexpected end of file - int32 expected
12 Halted 0 ms 0 KB -