제출 #1049325

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1049325		PlayVoltz	Restore Array (RMI19_restore)	C++17	100 / 100	130 ms	1620 KiB

restore

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

struct trio{
	int a, b, c;
};

int32_t main(){
	int n, m, a, b, c, d;
	cin>>n>>m;
	vector<int> psum(n+1, LLONG_MAX/2);
  	psum[0]=0;
	vector<trio> vect;
	while (m--){
		cin>>a>>b>>c>>d;
		++a, ++b;
		if (d)vect.pb({a-1, b, c-1});
		else vect.pb({b, a-1, -c});
	}
	for (int i=1; i<=n; ++i)vect.pb({i-1, i, 1}), vect.pb({i, i-1, 0});
	for (int i=0; i<n; ++i)for (auto [b, a, c]:vect)psum[a]=min(psum[a], psum[b]+c);
	for (auto [b, a, c]:vect)if (psum[b]+c<psum[a]){cout<<-1;return 0;}
	for (int i=1; i<=n; ++i)cout<<!(psum[i]-psum[i-1])<<" ";
}

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