Submission #1230553

#	Time	Username	Problem	Language	Result	Execution time	Memory
1230553		zyadhany	Restore Array (RMI19_restore)	C++20	7 / 100	203 ms	856 KiB

restore

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>

#define ll long long
#define ld long double
#define pl pair<ll, ll>
#define vi vector<ll>
#define vii vector<vi>
#define vc vector<char>
#define vcc vector<vc>
#define vp vector<pl>
#define mi map<ll,ll>
#define mc map<char,int>
#define sortx(X) sort(X.begin(),X.end());
#define all(X) X.begin(),X.end()
#define allr(X) X.rbegin(),X.rend()
#define ln '\n'
#define YES {cout << "Alice\n"; return;}
#define NO {cout << "Bob\n"; return;}
#define MUN {cout << "-1\n"; return;}

const int MODE = 1e9 + 7;

using namespace std;

const ll INF = 1e16;

class Graph {
public:
	struct edge {
		int u, v, w;
	};
    
	int size;
	vector<edge> E;
	
    void addEdge(int u, int v, int w) {
        edge ed = {u, v, w};
		E.push_back(ed);
    }

	vi BellmanFord(int src) {
		vi Z(size + 1, INF);
		Z[src] = 0;

		// itrate n - 1 to get shortest path.
		for (int i = 1; i <= size - 1; i++)
		{
			for (int j = 0; j < E.size(); j++)
			{
				ll u = E[j].u, v = E[j].v, w = E[j].w;
				if (Z[u] != INF && Z[u] + w < Z[v]) Z[v] = Z[u] + w;
			}
		}
		
		// itrate last time to ensure negrive syclic
		for (int i = 1; i <= size - 1; i++) {
			for (int j = 0; j < E.size(); j++)
			{
				ll u = E[j].u, v = E[j].v, w = E[j].w;
				if (Z[u] != INF && Z[u] + w < Z[v]) return {};
			}
		}

		return (Z);
	}

    Graph(ll n) {
        size = n;
    }
};


void solve(int tc) {
    ll n, m;
    cin >> n >> m;

    Graph gr(n);
    for (int i = 1; i <= n; i++)
    {
        gr.addEdge(0, i, i);
        gr.addEdge(i, i-1, 0);    
        gr.addEdge(i-1, i, 1);    
    }
    
    for (int i = 0; i < m; i++)
    {
        ll l, r, k, v;
        cin >> l >> r >> k >> v;
        l++, r++;
        ll len = r - l + 1;
        if (v == 0) {
            gr.addEdge(l-1, r, len - k);
        } else {
            gr.addEdge(r, l-1, len-k-1);
        }
    }
    
    auto P = gr.BellmanFord(0);
    if (P.empty()) {
        cout << "-1\n";
        return;
    }

    for (int i = 1; i <= n; i++)
    {
        cout << P[i]-P[i-1] << ' ';
    }
    cout << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    int size = 1;

    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    // cin >> size;
    for (int i = 1; i <= size; i++)
        solve(i);
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 13
• Subtask 3: 0 / 25
• Subtask 4: 0 / 55