Submission #1169582

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1169582	2025-03-19 02:23:41	sleepntsheep	Cats or Dogs (JOI18_catdog)	C++17	38 / 100	3095 ms	14896 KiB

catdog

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
#include "catdog.h"
#include <cstdio>
#include <vector>
#include <algorithm>
#define N 111111
struct Mat{
  long long a[4]={0};
  friend Mat operator*(const Mat &a, const Mat &b) {
    Mat c;
    c.a[0] = std::min(a.a[0] + b.a[0], a.a[1] + b.a[2]);
    c.a[1] = std::min(a.a[0] + b.a[1], a.a[1] + b.a[3]);
    c.a[2] = std::min(a.a[2] + b.a[0], a.a[3] + b.a[2]);
    c.a[3] = std::min(a.a[2] + b.a[1], a.a[3] + b.a[3]);
    return c;
  }
  void pt() {
  }
  friend Mat operator-(const Mat &a, const Mat &b) {
    Mat c;
    for (int j=0;j<4;++j)
    c.a[j] = a.a[j] - b.a[j];
    return c;
  }
  friend Mat operator+(const Mat &a, const Mat &b) {
    Mat c;
    for (int j=0;j<4;++j)
    c.a[j] = a.a[j] + b.a[j];
    return c;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 30 / 30
• Subtask 3: 0 / 62