Submission #57048603

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
#define CNO cout << "NO\n"
#define CYES cout << "YES\n"
#define endl '\n'
#define ls id << 1
#define rs id << 1 | 1
#define llen (mid - l + 1)
#define rlen (r - mid)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long double ld;
typedef __int128 i128;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll mod = 998244353;
const int N = 200010;
int n, arr[N];
ll ans = 0;
string str;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
#define CNO cout << "NO\n"
#define CYES cout << "YES\n"
#define endl '\n'
#define ls id << 1
#define rs id << 1 | 1
#define llen (mid - l + 1)
#define rlen (r - mid)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long double ld;
typedef __int128 i128;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll mod = 998244353;
const int N = 200010;
int n, arr[N];
ll ans = 0;
string str;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  int T = 1;
  // cin >> T;
  while (T--) {
    cin >> n;
    for (int i = 0; i < n; ++i) {
      cin >> arr[i];
    }
    ans = 0;
    for (int i = 0; i < n; ++i) {
      while (ans % 3 != 0) {
        if (ans % 3 == 2)
          arr[i] -= 3;
        else
          arr[i]--;
        ans++;
        if (arr[i] <= 0) break;
      }
      ll num = arr[i] / 5;
      ans += 3 * num;
      arr[i] = arr[i] % 5;
      while (arr[i] > 0) {
        if (ans % 3 == 2)
          arr[i] -= 3;
        else
          arr[i]--;
        ans++;
      }
      // cerr << i << ' ' << ans << endl;
    }
    cout << ans << endl;
  }
  return 0;
}

Submission Info

Judge Result