oj.uz

Submission #559090

# Submission time Handle Problem Language Result Execution time Memory
559090 2022-05-09T11:21:02 Z Tenis0206 Restore Array (RMI19_restore) C++11
20 / 100
 600 ms 864 KB 
#include <bits/stdc++.h>

using namespace std;

const int oo = 0x3f3f3f3f;

int n,m;

int d[5005],nr_nod[5005];
bool sel[5005];

vector<pair<int,int>> G[5005];

void Bellman()
{
    queue<int> q;
    for(int i=0; i<=n; i++)
    {
        d[i] = oo;
        sel[i] = false;
    }
    d[0] = 0;
    sel[0] = true;
    q.push(0);
    nr_nod[0] = 1;
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        sel[nod] = false;
        for(auto it : G[nod])
        {
            if(d[nod] + it.second < d[it.first])
            {
                d[it.first] = d[nod] + it.second;
                if(!sel[it.first])
                {
                    q.push(it.first);
                    sel[it.first] = true;
                }
                nr_nod[it.first] = nr_nod[nod] + 1;
                if(nr_nod[it.first] > n)
                {
                    cout<<-1<<'\n';
                    return;
                }
            }
        }
    }
    for(int i=0;i<=n;i++)
    {
        for(auto it : G[i])
        {
            if(d[i] + it.second < d[it.first])
            {
                cout<<-1<<'\n';
                return;
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        cout<<d[i] - d[i-1]<<' ';
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        G[i-1].push_back({i,1});
        G[i].push_back({i-1,0});
    }
    for(int i=1; i<=m; i++)
    {
        int l,r,k,val;
        cin>>l>>r>>k>>val;
        ++l;
        ++r;
        if(val==0)
        {
            G[l-1].push_back({r,(r - l + 1) - k});
        }
        else
        {
            G[r].push_back({l-1,-((r - l + 1) - (k - 1))});
        }
    }
    Bellman();
    return 0;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 852 KB Output is correct
2 Correct 14 ms 852 KB Output is correct
3 Correct 14 ms 852 KB Output is correct
4 Correct 12 ms 800 KB Output is correct
5 Correct 358 ms 852 KB Output is correct
6 Correct 424 ms 852 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 852 KB Output is correct
2 Correct 14 ms 852 KB Output is correct
3 Correct 14 ms 852 KB Output is correct
4 Correct 12 ms 800 KB Output is correct
5 Correct 358 ms 852 KB Output is correct
6 Correct 424 ms 852 KB Output is correct
7 Correct 11 ms 860 KB Output is correct
8 Correct 11 ms 860 KB Output is correct
9 Correct 18 ms 864 KB Output is correct
10 Correct 11 ms 852 KB Output is correct
11 Execution timed out 1025 ms 852 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 12 ms 852 KB Output is correct
12 Correct 14 ms 852 KB Output is correct
13 Correct 14 ms 852 KB Output is correct
14 Correct 12 ms 800 KB Output is correct
15 Correct 358 ms 852 KB Output is correct
16 Correct 424 ms 852 KB Output is correct
17 Correct 11 ms 860 KB Output is correct
18 Correct 11 ms 860 KB Output is correct
19 Correct 18 ms 864 KB Output is correct
20 Correct 11 ms 852 KB Output is correct
21 Execution timed out 1025 ms 852 KB Time limit exceeded
22 Halted 0 ms 0 KB -