oj.uz

Submission #636879

# Submission time Handle Problem Language Result Execution time Memory
636879 2022-08-30T11:03:17 Z ogibogi2004 Restore Array (RMI19_restore) C++14
45 / 100
 321 ms 764 KB 
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e4+6;
int A[MAXN],n,m;
vector<pair<int,int> >no_zero;
vector<pair<int,int> >no_one;
vector<pair<int,int> >one;
vector<pair<int,int> >zero;
vector<pair<pair<int,int>,int> >onezero;
int arr[MAXN];
bool done[2*MAXN];
struct condition
{
    int l,r,k,val;
};
int main()
{
    memset(arr,-1,sizeof(arr));
    cin>>n>>m;
    if(n<=18&&m<=200)
    {
        vector<condition>c;
        for(int i=0;i<m;i++)
        {
            int l,r,k,v;
            cin>>l>>r>>k>>v;
            c.push_back({l,r,k,v});
        }
        for(int mask=0;mask<(1<<n);mask++)
        {
            for(int i=0;i<n;i++)
            {
                if(mask&(1<<i))A[i]=1;
                else A[i]=0;
            }
            bool ok=true;
            for(auto xd:c)
            {
                vector<int>v;
                for(int j=xd.l;j<=xd.r;j++)
                {
                    v.push_back(A[j]);
                }
                sort(v.begin(),v.end());
                if(v[xd.k-1]!=xd.val)
                {
                    ok=false;break;
                }
            }
            if(ok)
            {
                for(int i=0;i<n;i++)
                {
                    cout<<A[i]<<" ";
                }
                cout<<endl;
                return 0;
            }
        }
        cout<<"-1\n";
        return 0;
    }
    for(int i=0;i<m;i++)
    {
        int l,r,k,val;
        cin>>l>>r>>k>>val;
        l++;r++;
        if(k==1&&val==1)no_zero.push_back({l,r});
        if(k==r-l+1&&val==1)one.push_back({l,r});
        if(k==1&&val==0)zero.push_back({l,r});
        if(k==r-l+1&&val==0)no_one.push_back({l,r});
    }
    for(auto xd:no_zero)
    {
        for(int i=xd.first;i<=xd.second;i++)
        {
            arr[i]=1;
        }
    }
    for(auto xd:no_one)
    {
        for(int i=xd.first;i<=xd.second;i++)
        {
            if(arr[i]==1)
            {
                cout<<"-1\n";
                return 0;
            }
            arr[i]=0;
        }
    }
    //for(int i=1;i<=n;i++)cout<<arr[i]<<" ";
    //cout<<endl;
    for(auto xd:one)
    {
        bool found=0;
        for(int i=xd.first;i<=xd.second;i++)
        {
            if(arr[i]==1)found=1;
        }
        if(!found)onezero.push_back({xd,1});
    }
    for(auto xd:zero)
    {
        bool found=0;
        for(int i=xd.first;i<=xd.second;i++)
        {
            if(arr[i]==0)found=1;
        }
        if(!found)onezero.push_back({xd,0});
    }
    for(int i=1;i<=n;i++)
    {
        if(arr[i]>=0)continue;
        int minr=n+1,what=-1;
        for(int j=0;j<onezero.size();j++)
        {
            if(done[j]==0&&onezero[j].first.second<minr)
            {
                minr=onezero[j].first.second;
                what=onezero[j].second;
            }
        }
        if(what==-1)
        {
            arr[i]=0;
        }
        else arr[i]=what;
        for(int j=0;j<onezero.size();j++)
        {
            if(onezero[j].first.first<=i&&onezero[j].first.second>=i&&onezero[j].second==arr[i])
            {
                done[j]=1;
            }
        }
    }
    //for(int i=1;i<=n;i++)cout<<arr[i]<<" ";
    //cout<<endl;
    for(int i=0;i<onezero.size();i++)
    {
        if(done[i]==0)
        {
            cout<<"-1\n";
            return 0;
        }
    }
    for(int i=1;i<=n;i++)cout<<arr[i]<<" ";
    cout<<endl;
return 0;
}

Compilation message

restore.cpp: In function 'int main()':
restore.cpp:116:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |         for(int j=0;j<onezero.size();j++)
      |                     ~^~~~~~~~~~~~~~~
restore.cpp:129:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |         for(int j=0;j<onezero.size();j++)
      |                     ~^~~~~~~~~~~~~~~
restore.cpp:139:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |     for(int i=0;i<onezero.size();i++)
      |                 ~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 15 ms 340 KB Output is correct
4 Correct 18 ms 356 KB Output is correct
5 Correct 194 ms 340 KB Output is correct
6 Correct 100 ms 340 KB Output is correct
7 Correct 31 ms 340 KB Output is correct
8 Correct 31 ms 340 KB Output is correct
9 Correct 86 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 712 KB Output is correct
2 Correct 149 ms 580 KB Output is correct
3 Correct 289 ms 680 KB Output is correct
4 Correct 283 ms 660 KB Output is correct
5 Correct 9 ms 460 KB Output is correct
6 Correct 10 ms 468 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 712 KB Output is correct
2 Correct 149 ms 580 KB Output is correct
3 Correct 289 ms 680 KB Output is correct
4 Correct 283 ms 660 KB Output is correct
5 Correct 9 ms 460 KB Output is correct
6 Correct 10 ms 468 KB Output is correct
7 Correct 321 ms 764 KB Output is correct
8 Correct 174 ms 628 KB Output is correct
9 Correct 178 ms 628 KB Output is correct
10 Correct 133 ms 596 KB Output is correct
11 Correct 10 ms 468 KB Output is correct
12 Correct 8 ms 468 KB Output is correct
13 Correct 152 ms 596 KB Output is correct
14 Correct 17 ms 468 KB Output is correct
15 Correct 14 ms 504 KB Output is correct
16 Correct 14 ms 468 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 15 ms 340 KB Output is correct
4 Correct 18 ms 356 KB Output is correct
5 Correct 194 ms 340 KB Output is correct
6 Correct 100 ms 340 KB Output is correct
7 Correct 31 ms 340 KB Output is correct
8 Correct 31 ms 340 KB Output is correct
9 Correct 86 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 287 ms 712 KB Output is correct
12 Correct 149 ms 580 KB Output is correct
13 Correct 289 ms 680 KB Output is correct
14 Correct 283 ms 660 KB Output is correct
15 Correct 9 ms 460 KB Output is correct
16 Correct 10 ms 468 KB Output is correct
17 Correct 321 ms 764 KB Output is correct
18 Correct 174 ms 628 KB Output is correct
19 Correct 178 ms 628 KB Output is correct
20 Correct 133 ms 596 KB Output is correct
21 Correct 10 ms 468 KB Output is correct
22 Correct 8 ms 468 KB Output is correct
23 Correct 152 ms 596 KB Output is correct
24 Correct 17 ms 468 KB Output is correct
25 Correct 14 ms 504 KB Output is correct
26 Correct 14 ms 468 KB Output is correct
27 Incorrect 8 ms 460 KB Output isn't correct
28 Halted 0 ms 0 KB -