oj.uz

Submission #710915

# Submission time Handle Problem Language Result Execution time Memory
710915 2023-03-16T04:57:17 Z Sanzhar23 Restore Array (RMI19_restore) C++14
13 / 100
 3 ms 532 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long	
#define pb push_back
#define bug cout << "bug" << endl
#define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define pll pair <ll, ll> 
#define pii pair <int, int> 
#define triple pair <pair <ll, ll> , ll>   
#define ull unsigned long long
#define ld long double
#define pinode pair <node*, node*>

const ll INF = 9e18 + 5;
const ll inf = 1e9 + 5;
const ll N = 1e4 + 5;
const ll shift = 2e6;
const ll mod = 998244353;
const ll mod2 = 1e9 + 9;
const ll M = 1e3 + 5;
const ll LOG = 21;
const ll sp = 263;
const ll sp2 = 9973;
const int block = 100;
const double eps = 1e-10;

int n, m, l[N], r[N], k[N], val[N], a[N], pref[N];
int sb2 = 1, can = 1, sb3 = 1;

int main(){
	speed;
	cin >> n >> m;
	for(int i = 1; i <= m; i++){
		cin >> l[i] >> r[i] >> k[i] >> val[i];
		l[i]++;
		r[i]++;
		if(k[i] != 1)
			sb2 = 0;
		if(k[i] !=  r[i] - l[i] + 1)
			sb3 = 0;
	}
	if(sb2){
		for(int i = 1; i <= m; i++){
			if(val[i] == 1){
				a[l[i]]++;
				a[r[i] + 1]--;
			}
		}
		for(int i = 1; i <= n; i++){
			a[i] += a[i - 1];
		}
		for(int i = 1; i <= n; i++)
			a[i] = min(a[i], 1);
		for(int i = 1; i <= n; i++){
			pref[i] = pref[i - 1] + a[i];
		}
		for(int i = 1; i <= m; i++){
			if(val[i] == 0){
				if(pref[r[i]] - pref[l[i] - 1] == r[i] - l[i] + 1)
					can = 0;
			}
		}	
		if(!can){
			cout << -1 << endl;
			return 0;
		}
		for(int i = 1; i <= n; i++){
			cout << a[i] << " ";
		}
		return 0;
	}
	if(sb3){
		for(int i = 1; i <= m; i++){
			if(val[i] == 0){
				a[l[i]]++;
				a[r[i] + 1]--;
			}
		}
		for(int i = 1; i <= n; i++){
			a[i] += a[i - 1];
		}
		for(int i = 1; i <= n; i++){
			a[i] = min(a[i], 0);
			pref[i] = pref[i - 1] + a[i];
		}
		for(int i = 1; i <= m; i++){
			if(val[i] == 1){
				if(pref[r[i]] - pref[l[i] - 1] == r[i] - l[i] + 1) can = 0;
			}
		}
		if(!can){
			cout << -1 << endl;
			return 0;
		}
		for(int i = 1; i <= n; i++){
			cout << (a[i] ^ 1) << " ";
		}
		return 0;
	}
}
/*	
%I64d6


6 1 3
8 1 2 1 5 4		
		



%I64d
*/

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

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

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 532 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Incorrect 3 ms 468 KB Unexpected end of file - int32 expected
8 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -