oj.uz

Submission #52360

# Submission time Handle Problem Language Result Execution time Memory
52360 2018-06-25T15:17:44 Z ainch(#1359) Pinball (JOI14_pinball) C++11
11 / 100
 286 ms 792 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int M = 12;
const int N = 1002;

using lint = long long;

int a[M], b[M], c[M], d[M];

int m, n;

lint cost (int o) {
	lint r = 0;
	for (int i = 0; i < m; i++) {
		if (o & (1 << i)) {
			r = r + (lint)d[i];
		}
	}
	return r;
}

bool get (int o) {
	vector < bool > v(n+1,false);
	int cnt = 0;
	for (int i = 1; i <= n; i++) {
		int p = i;

		for (int j = 0; j < m; j++) {
			if (o & (1 << j)) {
				if (a[j] <= p && p <= b[j]) {
					p = c[j];
				}
			}
		}
	
		if (!v[p]) {
			v[p] = true;
			++cnt;
		}
	}
	if (cnt == 1)return true;
	else return false;
}

int main () {
	//freopen ("in.txt", "r", stdin);
	scanf ("%d%d", &m, &n);
	for (int i = 0; i < m; i++) {
		scanf ("%d%d%d%d", a + i, b + i, c + i, d + i);
	}
	lint t = 1e12;
	for (int i = 0; i < (1 << m); i++) {
		if (get (i)) {
			t = min (t, cost (i));
		}
	}
	if (t == 1e12) {
		puts ("-1");
	}
	else {
		printf ("%lld\n", t);
	}

	return 0;
}

Compilation message

pinball.cpp: In function 'int main()':
pinball.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d%d", &m, &n);
  ~~~~~~^~~~~~~~~~~~~~~~
pinball.cpp:52:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d%d%d%d", a + i, b + i, c + i, d + i);
   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 432 KB Output is correct
4 Correct 10 ms 432 KB Output is correct
5 Correct 18 ms 488 KB Output is correct
6 Correct 4 ms 488 KB Output is correct
7 Correct 19 ms 528 KB Output is correct
8 Correct 18 ms 528 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 432 KB Output is correct
4 Correct 10 ms 432 KB Output is correct
5 Correct 18 ms 488 KB Output is correct
6 Correct 4 ms 488 KB Output is correct
7 Correct 19 ms 528 KB Output is correct
8 Correct 18 ms 528 KB Output is correct
9 Runtime error 286 ms 792 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 432 KB Output is correct
4 Correct 10 ms 432 KB Output is correct
5 Correct 18 ms 488 KB Output is correct
6 Correct 4 ms 488 KB Output is correct
7 Correct 19 ms 528 KB Output is correct
8 Correct 18 ms 528 KB Output is correct
9 Runtime error 286 ms 792 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 432 KB Output is correct
4 Correct 10 ms 432 KB Output is correct
5 Correct 18 ms 488 KB Output is correct
6 Correct 4 ms 488 KB Output is correct
7 Correct 19 ms 528 KB Output is correct
8 Correct 18 ms 528 KB Output is correct
9 Runtime error 286 ms 792 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Halted 0 ms 0 KB -