oj.uz

Submission #897568

# Submission time Handle Problem Language Result Execution time Memory
897568 2024-01-03T12:31:48 Z bleahbleah Security Guard (JOI23_guard) C++17
0 / 100
 10 ms 2652 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;
using ld = long double;

#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

vector<int> S;

signed main() {
  cin.tie(0) -> sync_with_stdio(0);
  int n, m, q;
  cin >> n >> m >> q;
  S.resize(n);
  
  for(auto &x : S) cin >> x;
  
  //reverse(all(S));
  
  ll sum = 0;
  
  for(int i = 0; i < n - 1; i++)
    sum += (S[i] == S[i + 1]) * S[i];
  S.erase(unique(all(S)), end(S));
  
  n = sz(S);
  
  int mx = *max_element(all(S));
  
  int revers = 0;
  
  for(int i = 0; i < n - 1; i++) {
    if(revers == 0) {
      sum += S[i + 1];
      if(S[i + 1] == mx)
        revers = 1;
    }
    else if(revers) {
      sum += S[i];
    }
  }
  
  cout << sum << '\n';
  
  
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 8 ms 2400 KB Output is correct
3 Correct 8 ms 2652 KB Output is correct
4 Correct 10 ms 2648 KB Output is correct
5 Correct 9 ms 2652 KB Output is correct
6 Correct 9 ms 2652 KB Output is correct
7 Correct 9 ms 2652 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 8 ms 2400 KB Output is correct
3 Correct 8 ms 2652 KB Output is correct
4 Correct 10 ms 2648 KB Output is correct
5 Correct 9 ms 2652 KB Output is correct
6 Correct 9 ms 2652 KB Output is correct
7 Correct 9 ms 2652 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 8 ms 2400 KB Output is correct
3 Correct 8 ms 2652 KB Output is correct
4 Correct 10 ms 2648 KB Output is correct
5 Correct 9 ms 2652 KB Output is correct
6 Correct 9 ms 2652 KB Output is correct
7 Correct 9 ms 2652 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 8 ms 2400 KB Output is correct
3 Correct 8 ms 2652 KB Output is correct
4 Correct 10 ms 2648 KB Output is correct
5 Correct 9 ms 2652 KB Output is correct
6 Correct 9 ms 2652 KB Output is correct
7 Correct 9 ms 2652 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 8 ms 2400 KB Output is correct
3 Correct 8 ms 2652 KB Output is correct
4 Correct 10 ms 2648 KB Output is correct
5 Correct 9 ms 2652 KB Output is correct
6 Correct 9 ms 2652 KB Output is correct
7 Correct 9 ms 2652 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -