oj.uz

Submission #272412

# Submission time Handle Problem Language Result Execution time Memory
272412 2020-08-18T11:42:51 Z eohomegrownapps Restore Array (RMI19_restore) C++14
7 / 100
 141 ms 98440 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n,m;

void relaxedges(){
	int a[20001], b[20001], c[20001];
	for (int i = 0; i<m; i++){
		int l,r,k,v;
		cin>>l>>r>>k>>v;
		r++;
		if (v==0){
			a[i]=l;
			b[i]=r;
			c[i]=k-(r-l);
		} else {
			a[i]=r;
			b[i]=l;
			c[i]=(r-l)-k+1;
		}
	}
	for (int i = 0; i<n; i++){
		a[m+2*i]=i;
		b[m+2*i]=i+1;
		c[m+2*i]=-1;
		a[m+2*i+1]=i+1;
		b[m+2*i+1]=i;
		c[m+2*i+1]=0;
	}
	m+=2*n;
	bool changed = true;
	bool works = true;
	int minvals[20001], maxvals[20001];
	for (int i = 0; i<=n; i++){
		minvals[i]=0;
		maxvals[i]=i;
	}
	while (changed&&works){
		changed=false;
		for (int i = 0; i<m; i++){
			if (minvals[b[i]]+c[i]>minvals[a[i]]){
				changed=true;
				minvals[a[i]]=minvals[b[i]]+c[i];
			}
			if (maxvals[a[i]]-c[i]<maxvals[b[i]]){
				changed=true;
				maxvals[b[i]]=maxvals[a[i]]-c[i];
			}
			if (minvals[a[i]]>maxvals[a[i]]){
				works=false;
			}
			if (minvals[b[i]]>maxvals[b[i]]){
				works=false;
			}
		}
	}
	if (!works){
		cout<<-1<<'\n';
		return;
	}
	/*for (int i = 0; i<=n; i++){
		cout<<minvals[i]<<' '<<maxvals[i]<<'\n';
	}*/
	vector<vector<int>> parent(n+1,vector<int>(n+1,-1));
	//assert(minvals[0]==0&&maxvals[0]==0);
	parent[0][0]=0;
	int ind = 0;
	for (int y = 1; y<=n; y++){
		bool works = false;
		for (int x = maxvals[y]; x>=minvals[y]; x--){
			if (x-1>=0){
				if (parent[y-1][x-1]!=-1){
					parent[y][x]=x-1;
					works=true;
					ind = x;
				}
			}
			if (parent[y-1][x]!=-1){
				parent[y][x]=x;
				works=true;
				ind = x;
			}
		}
		if (!works){
			cout<<-1<<'\n';
			return;
		}
	}
	/*for (int y = 0; y<=n; y++){
		for (int x = 0; x<=n; x++){
			cout<<parent[y][x]<<' ';
		}cout<<'\n';
	}*/
	vector<bool> ans;
	for (int i = n; i>0; i--){
		if (ind==parent[i][ind]){
			ans.push_back(0);
		} else {
			ans.push_back(1);
		}
		ind=parent[i][ind];
	}
	reverse(ans.begin(),ans.end());
	for (int i = 0; i<n; i++){
		cout<<ans[i]<<' ';
	}cout<<'\n';
	vector<int> s(n+1,0);
	for (int i = 1; i<=n; i++){
		s[i]=s[i-1]+ans[i-1];
		//cout<<minvals[i]<<' '<<maxvals[i]<<' '<<s[i]<<'\n';
		assert(minvals[i]<=s[i]&&s[i]<=maxvals[i]);
	}
	/*for (int i = 0; i<m; i++){
		assert(s[a[i]]>=s[b[i]]+c[i]);
	}*/
}


int main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	cin>>n>>m;
	/*if (n<=18){
		subtask1();
	} else {*/
		relaxedges();
	//}
}

Subtask #1
7.0 / 7.0

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

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 141 ms 98440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 141 ms 98440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Incorrect 141 ms 98440 KB Output isn't correct
12 Halted 0 ms 0 KB -