답안 #1086534

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1086534	2024-09-11T01:50:57 Z	mingga	Infinite Race (EGOI24_infiniterace2)	C++17	29 / 100	11 ms	4700 KB

Main

#include "bits/stdc++.h"

using namespace std;

#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define fast_cin()                  \
  ios_base::sync_with_stdio(false); \
  cin.tie(NULL)
#define out(file) freopen(file, "w", stdout)
#define in(file) freopen(file, "r", stdin)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define int long long
int MOD = 1e9 + 7;
const int N = 2e5 + 7;
int n, q;
int x[N];

void sub1() {
  int cnt = 0;
  int cur = 0;
  while(q--) {
    int u; cin >> u;
    if(u < 0) {
      cur = 0;
    } else {
      if(cur == 1) cnt++;
      else cur = 1;
    }
  }
  cout << cnt;
}

void sub2() {
  vector<int> state(n+1, 0);
  int ans = 0;
  int cur = 0;
  for(int i = 1; i <= q; i++) {
    if(cur) {
      if(x[i] != x[i-1]) cur = 0;
      else ans++;
    } else {
      if(state[x[i]]) ans++,cur = 1;
      else state[x[i]] = 1;
    }
  }
  cout << ans;
}

signed main() {
    fast_cin();
    cin >> n >> q;
    if(n == 2) sub1();
    else {
      bool ok = 1;
      for(int i = 1; i <= q; i++) {
        cin >> x[i];
        if(x[i] < 0) ok = 0;
      }
      if(ok) sub2();
    }
    cerr << "\nTime: " << clock() * 1000 / CLOCKS_PER_SEC;
}

Subtask #1

29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	8 ms	732 KB	Output is correct
5	Correct	8 ms	860 KB	Output is correct
6	Correct	9 ms	856 KB	Output is correct
7	Correct	8 ms	856 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	464 KB	Output is correct
10	Correct	7 ms	860 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	7 ms	860 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	9 ms	856 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	8 ms	964 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	7 ms	860 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct

Subtask #2

0.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	7 ms	860 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	11 ms	4700 KB	Output is correct
6	Correct	1 ms	1884 KB	Output is correct
7	Correct	8 ms	2292 KB	Output is correct
8	Incorrect	7 ms	2392 KB	Output isn't correct
9	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Incorrect	1 ms	348 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	8 ms	732 KB	Output is correct
5	Correct	8 ms	860 KB	Output is correct
6	Correct	9 ms	856 KB	Output is correct
7	Correct	8 ms	856 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	464 KB	Output is correct
10	Correct	7 ms	860 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	7 ms	860 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	9 ms	856 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	8 ms	964 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	7 ms	860 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	7 ms	860 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	11 ms	4700 KB	Output is correct
26	Correct	1 ms	1884 KB	Output is correct
27	Correct	8 ms	2292 KB	Output is correct
28	Incorrect	7 ms	2392 KB	Output isn't correct
29	Halted	0 ms	0 KB	-