-
Notifications
You must be signed in to change notification settings - Fork 0
/
1064.cpp
101 lines (78 loc) · 1.82 KB
/
1064.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
/*
**************************************************************
* Author : Bemen Girgis
* Contact : [email protected]
* Problem : 1064 UVA
* Link : https://onlinejudge.org/external/10/p1064.pdf
**************************************************************
* Approach:
**************************************************************
*/
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <set>
#include <cstring>
#include <vector>
using namespace std;
struct packet {
bool operator<(const packet x) const{
return this->start < x.start;
}
int num;
int start;
int end;
};
int n, m;
int message[6];
int order[5];
packet data[1005];
bool done[1005];
int solve() {
memset(done, 0, m);
int buff = 0, max_buff = 0;
for (int i = 0; i < n; ++i) {
int message_no = order[i];
set<packet> fragment;
int cur_en = 0;
for (int j = 0; j < m; ++j) {
if (!done[j]) {
done[j] = true;
buff += (data[j].end - data[j].start + 1);
}
if (data[j].num == message_no) {
fragment.insert(data[j]);
auto cur_frag = fragment.begin();
while (!fragment.empty() && cur_frag->start == cur_en + 1) {
cur_en = cur_frag->end;
buff -= (cur_frag->end - cur_frag->start + 1);
cur_frag = fragment.erase(fragment.begin());
}
if (message[message_no] == cur_en) {
break;
}
}
max_buff = max(buff, max_buff);
}
}
return max_buff;
}
int main() {
int tc = 0;
while (scanf("%d %d\n", &n, &m), n && m) {
iota(order, order + 5, 0);
for (int i = 0; i < n; ++i) {
scanf("%d", message + i);
}
for (int i = 0; i < m; ++i) {
auto &it = data[i];
scanf("%d %d %d", &it.num, &it.start, &it.end); --it.num;
}
int buff = 1e9;
do {
buff = min(buff, solve());
} while (next_permutation(order, order + n));
printf("Case %d: %d\n\n", ++tc, buff);
}
return 0;
}