oj.uz

Submission #493756

# Submission time Handle Problem Language Result Execution time Memory
493756 2021-12-12T19:25:56 Z Cristian Restore Array (RMI19_restore) C++14
20 / 100
 56 ms 644 KB 
#include <iostream>

using namespace std;
const int NMAX = 10005;
int v[NMAX], sp[NMAX], l[NMAX], r[NMAX], k[NMAX], value[NMAX], SP1[NMAX], SP0[NMAX], set1[NMAX], set0[NMAX], SP[NMAX];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, m, i, ns, b, subtask, ok, j;
    cin >> n >> m;
    subtask = 2;
    for(i = 1; i <= m; i++)
    {
        cin >> l[i] >> r[i] >> k[i] >> value[i];
        l[i]++;
        r[i]++;
        if(k[i] != 1)
            subtask = 3;
    }
    /// Subtask #1
    if(n <= 18 && m <= 200)
    {
        ns = (1 << n);
        for(b = 0; b < ns; b++)
        {
            sp[0] = 0;
            for(i = 1; i <= n; i++)
            {
                sp[i] = sp[i - 1];
                if((1 << (i-1)) & b)
                    sp[i]++;
            }
            ok = 1;
            for(i = 1; i <= m; i++)
            {
                if(value[i] == 0 && sp[r[i]] - sp[l[i] - 1] > r[i] - l[i] - k[i] + 1)
                {
                    ok = 0;
                    break;
                }
                if(value[i] == 1 && sp[r[i]] - sp[l[i] - 1] < r[i] - l[i] - k[i] + 2)
                {
                    ok = 0;
                    break;
                }
            }
            if(ok)
            {
                for(i = 1; i <= n; i++)
                {
                    cout << sp[i] - sp[i-1] << ' ';
                }
                return 0;
            }
        }
        cout << "-1";
        return 0;
    }
    /// Subtask #2
    if(subtask == 2)
    {
        for(i = 1; i <= m; i++)
        {
            if(value[i] == 1)
            {
                SP[r[i] + 1]--;
                SP[l[i]]++;
            }
        }
        for(i = 1; i <= n; i++)
        {
            SP[i] += SP[i-1];
            if(SP[i])
                v[i] = 1;
            else
                v[i] = 0;
            sp[i] = sp[i-1] + v[i];
        }
        ok = 1;
        for(i = 1; i <= m; i++)
        {
            if(value[i] == 0 && sp[r[i]] - sp[l[i] - 1] > r[i] - l[i] - k[i] + 1)
            {
                ok = 0;
                break;
            }
            if(value[i] == 1 && sp[r[i]] - sp[l[i] - 1] < r[i] - l[i] - k[i] + 2)
            {
                ok = 0;
                break;
            }
        }

        if(!ok)
        {
            cout << "-1";
            return 0;
        }
        for(i = 1; i <= n; i++)
            cout << v[i] << ' ';
        return 0;
    }
    if(subtask == 3)
    {
        for(i = 1; i <= n; i++)
            v[i] = 2;
        for(i = 1; i <= m; i++)
        {
            if(k[i] == 1 && value[i] == 1)
            {
                for(j = l[i]; j <= r[i]; j++)
                    v[j] = 1;
            }
            if(k[i] == r[i] - l[i] + 1 && value[i] == 0)
            {
                for(j = l[i]; j <= r[i]; j++)
                {
                    if(v[j] != 2)
                    {
                        cout << "-1";
                        return 0;
                    }
                    v[j] = 0;
                }
            }
        }
        for(i = 1; i <= m; i++)
        {
            if(k[i] == 1 && value[i] == 0)
            {
                ok = 0;
                for(j = l[i]; j <= r[i]; j++)
                {
                    if(v[j] == 0)
                        ok = 1;
                    if(v[j] == 2 && !ok)
                    {
                        v[j] = 0;
                        ok = 1;
                    }
                }
                if(!ok)
                {
                    cout << "-1";
                    return 0;
                }
            }
            if(k[i] == r[i] - l[i] + 1 && value[i] == 1)
            {
                ok = 0;
                for(j = l[i]; j <= r[i]; j++)
                {
                    if(v[j] == 1)
                        ok = 1;
                    if(v[j] == 2 && !ok)
                    {
                        v[j] = 1;
                        ok = 1;
                    }
                }
                if(!ok)
                {
                    cout << "-1";
                    return 0;
                }
            }
        }
        for(i = 1; i <= n; i++)
        {
            if(v[i] == 2)
                cout << "1 ";
            else
                cout << v[i] << ' ';
        }
    }
    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 15 ms 332 KB Output is correct
6 Correct 8 ms 332 KB Output is correct
7 Correct 4 ms 332 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 16 ms 344 KB Output is correct
10 Correct 0 ms 332 KB Output is correct

Subtask #2
13.0 / 13.0

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

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 460 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 54 ms 492 KB Output is correct
8 Correct 56 ms 636 KB Output is correct
9 Correct 55 ms 644 KB Output is correct
10 Correct 55 ms 612 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 53 ms 636 KB Output is correct
14 Incorrect 4 ms 588 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 15 ms 332 KB Output is correct
6 Correct 8 ms 332 KB Output is correct
7 Correct 4 ms 332 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 16 ms 344 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 3 ms 460 KB Output is correct
14 Correct 3 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 54 ms 492 KB Output is correct
18 Correct 56 ms 636 KB Output is correct
19 Correct 55 ms 644 KB Output is correct
20 Correct 55 ms 612 KB Output is correct
21 Correct 3 ms 588 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 53 ms 636 KB Output is correct
24 Incorrect 4 ms 588 KB Output isn't correct
25 Halted 0 ms 0 KB -