제출 #897568

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
897568		bleahbleah	Security Guard (JOI23_guard)	C++17	0 / 100	10 ms	2652 KiB

guard

#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
• Subtask 2: 0 / 13
• Subtask 3: 0 / 12
• Subtask 4: 0 / 13
• Subtask 5: 0 / 8
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24