summaryrefslogtreecommitdiffstats
path: root/šola/aps1/dn
diff options
context:
space:
mode:
authorAnton Luka Šijanec <anton@sijanec.eu>2024-10-31 14:54:29 +0100
committerAnton Luka Šijanec <anton@sijanec.eu>2024-10-31 14:54:29 +0100
commit9c061b8b28b48612b8abbf5209783fdd2bc04fb8 (patch)
tree38bbdb46988c9ed70fa115dab3c680ebf86192aa /šola/aps1/dn
parentcv (diff)
downloadr-9c061b8b28b48612b8abbf5209783fdd2bc04fb8.tar
r-9c061b8b28b48612b8abbf5209783fdd2bc04fb8.tar.gz
r-9c061b8b28b48612b8abbf5209783fdd2bc04fb8.tar.bz2
r-9c061b8b28b48612b8abbf5209783fdd2bc04fb8.tar.lz
r-9c061b8b28b48612b8abbf5209783fdd2bc04fb8.tar.xz
r-9c061b8b28b48612b8abbf5209783fdd2bc04fb8.tar.zst
r-9c061b8b28b48612b8abbf5209783fdd2bc04fb8.zip
Diffstat (limited to 'šola/aps1/dn')
-rw-r--r--šola/aps1/dn/osvetlitev/Makefile4
-rw-r--r--šola/aps1/dn/osvetlitev/in.txt9
-rw-r--r--šola/aps1/dn/osvetlitev/resitev.cpp46
3 files changed, 59 insertions, 0 deletions
diff --git a/šola/aps1/dn/osvetlitev/Makefile b/šola/aps1/dn/osvetlitev/Makefile
new file mode 100644
index 0000000..2d78386
--- /dev/null
+++ b/šola/aps1/dn/osvetlitev/Makefile
@@ -0,0 +1,4 @@
+program: resitev.cpp
+ g++ -Wall -Wextra -pedantic -Wformat-security -std=c++20 -o$@ $<
+clean:
+ rm program
diff --git a/šola/aps1/dn/osvetlitev/in.txt b/šola/aps1/dn/osvetlitev/in.txt
new file mode 100644
index 0000000..76b90fe
--- /dev/null
+++ b/šola/aps1/dn/osvetlitev/in.txt
@@ -0,0 +1,9 @@
+30
+7
+10 2
+23 2
+14 1
+4 1
+14 4
+11 5
+1 2
diff --git a/šola/aps1/dn/osvetlitev/resitev.cpp b/šola/aps1/dn/osvetlitev/resitev.cpp
new file mode 100644
index 0000000..0a17f31
--- /dev/null
+++ b/šola/aps1/dn/osvetlitev/resitev.cpp
@@ -0,0 +1,46 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+struct event {
+ int pos;
+ bool tip; // true za začetek, false za konec
+};
+int compar_events (const void * a, const void * b) {
+ if (((struct event *) a)->pos == ((struct event *) b)->pos)
+ return 0;
+ if (((struct event *) a)->pos < ((struct event *) b)->pos)
+ return -1;
+ return 1;
+}
+int main (void) {
+ struct event events[20000];
+ int M, N, x, d;
+ scanf("%d %d", &M, &N);
+ for (int i = 0; i < N; i++) {
+ scanf("%d %d", &x, &d);
+ events[2*i].pos = x-d >= 0 ? x-d : 0;
+ events[2*i].tip = true;
+ events[2*i+1].pos = x+d <= M ? x+d : M;
+ events[2*i+1].tip = false;
+ }
+ qsort(events, 2*N, sizeof events[0], compar_events);
+ int osv = 0;
+ int depth = 0;
+ int start;
+ for (int i = 0; i < 2*N; i++) {
+ // fprintf(stderr, "pos=%d\ttip=%d\n", events[i].pos, events[i].tip);
+ if (events[i].tip == true) {
+ if (depth == 0)
+ start = events[i].pos;
+ depth++;
+ }
+ if (events[i].tip == false) {
+ depth--;
+ if (depth == 0)
+ osv += events[i].pos - start;
+ }
+ }
+ if (depth != 0)
+ fprintf(stderr, "depth == %d\n", depth);
+ printf("%d\n", M-osv);
+}