oj.uz

Submission #198592

# Submission time Handle Problem Language Result Execution time Memory
198592 2020-01-26T18:07:07 Z Akashi Restore Array (RMI19_restore) C++14
100 / 100
 382 ms 952 KB 
#include <bits/stdc++.h>
using namespace std;

const int INF = 1e9;
int n, m;

struct edge{
	int x, y, c;
};

vector <edge> v;
void add_edge(int x, int y, int c){
	v.push_back({x, y, c});
}

int d[5005];
queue <int> q;
bool bellman(){
	for(int i = 1; i <= n ; ++i) d[i] = INF;
	d[0] = 0;
	
	for(int i = 1; i <= n + 1 ; ++i)
		for(auto it : v) d[it.y] = min(d[it.y], d[it.x] + it.c);	

	for(auto it : v)
		if(d[it.y] > d[it.x] + it.c) return 0;
	
	return 1;
}

int main(){	
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= n ; ++i){
		add_edge(i - 1, i, 1);
		add_edge(i, i - 1, 0);
	}
	
	int l, r, k, val;
	for(int i = 1; i <= m ; ++i){
		scanf("%d%d%d%d", &l, &r, &k, &val);
		++l; ++r;
		
		if(val == 1) add_edge(r, l - 1, (k - 1) - (r - l + 1));
		else add_edge(l - 1, r, (r - l + 1) - k);
	}
	
	bool ok = bellman();
	if(!ok) printf("-1");
	else{
		for(int i = 1; i <= n ; ++i)
			printf("%d ", d[i] - d[i - 1]);
	}
 	
	return 0;
}

Compilation message

restore.cpp: In function 'int main()':
restore.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
restore.cpp:40:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d", &l, &r, &k, &val);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 362 ms 824 KB Output is correct
2 Correct 371 ms 828 KB Output is correct
3 Correct 363 ms 884 KB Output is correct
4 Correct 366 ms 824 KB Output is correct
5 Correct 354 ms 824 KB Output is correct
6 Correct 363 ms 824 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 362 ms 824 KB Output is correct
2 Correct 371 ms 828 KB Output is correct
3 Correct 363 ms 884 KB Output is correct
4 Correct 366 ms 824 KB Output is correct
5 Correct 354 ms 824 KB Output is correct
6 Correct 363 ms 824 KB Output is correct
7 Correct 369 ms 884 KB Output is correct
8 Correct 367 ms 828 KB Output is correct
9 Correct 380 ms 696 KB Output is correct
10 Correct 362 ms 824 KB Output is correct
11 Correct 368 ms 952 KB Output is correct
12 Correct 367 ms 824 KB Output is correct
13 Correct 362 ms 820 KB Output is correct
14 Correct 382 ms 824 KB Output is correct
15 Correct 378 ms 824 KB Output is correct
16 Correct 378 ms 884 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 362 ms 824 KB Output is correct
12 Correct 371 ms 828 KB Output is correct
13 Correct 363 ms 884 KB Output is correct
14 Correct 366 ms 824 KB Output is correct
15 Correct 354 ms 824 KB Output is correct
16 Correct 363 ms 824 KB Output is correct
17 Correct 369 ms 884 KB Output is correct
18 Correct 367 ms 828 KB Output is correct
19 Correct 380 ms 696 KB Output is correct
20 Correct 362 ms 824 KB Output is correct
21 Correct 368 ms 952 KB Output is correct
22 Correct 367 ms 824 KB Output is correct
23 Correct 362 ms 820 KB Output is correct
24 Correct 382 ms 824 KB Output is correct
25 Correct 378 ms 824 KB Output is correct
26 Correct 378 ms 884 KB Output is correct
27 Correct 359 ms 824 KB Output is correct
28 Correct 363 ms 828 KB Output is correct
29 Correct 360 ms 824 KB Output is correct
30 Correct 370 ms 824 KB Output is correct
31 Correct 357 ms 828 KB Output is correct
32 Correct 365 ms 824 KB Output is correct
33 Correct 374 ms 824 KB Output is correct
34 Correct 362 ms 824 KB Output is correct
35 Correct 371 ms 824 KB Output is correct
36 Correct 367 ms 824 KB Output is correct