oj.uz

Submission #708981

# Submission time Handle Problem Language Result Execution time Memory
708981 2023-03-13T03:30:17 Z vjudge1 Akcija (COCI15_akcija) C++17
80 / 80
 15 ms 2036 KB 
#include<bits/stdc++.h>

#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
 
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define ppb pop_back
#define ft first
#define sd second
#define ll long long
#define pll pair<ll,ll>
const int N = 2e5 + 5;
const int M = 1e7 + 5;
const int B = 316;
const ll msize = 101;
const ll mod = 998244353;
const long long inf = 3e18;

struct Mat { vector<vector<ll>> mt = vector<vector<ll>> (msize, vector<ll>(msize, 0)); Mat operator *(const Mat& other) { Mat c; for (int i = 0; i < msize; ++ i) { for (int j = 0; j < msize; ++ j) { for (int k = 0; k < msize; ++ k) { c.mt[i][k] = max(c.mt[i][k], mt[i][j] + other.mt[j][k]); } } } return c; } };
ll binmul(ll x, ll ti, ll m) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= m; res %= m;} return res;}
ll binpow(ll x, ll ti, ll m) { ll res = 1;while (ti){if(ti & 1)res=binmul(res,x,m);x=binmul(x,x,m);ti >>= 1; x %= m; res %= m;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }

ll n, a[N], dp[N];

const void solve() {
	cin >> n;
	for (int i = 1; i <= n; ++ i) cin >> a[i];
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= n; ++ i) dp[i] = inf;
	for (int i = 1; i <= n; ++ i) {
		dp[i] = dp[i - 1] + a[i];
		if (i > 2) dp[i] = min(dp[i], dp[i - 3] + a[i] + a[i - 1]);
	}
	cout << dp[n];
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    srand(time(NULL));
    // file("cowsignal");

    int tt = 1;
//    cin >> tt;

    for (int i = 1; i <= tt; ++ i) {
        // cout << "Case " << i << ": ";
        solve();
    }

    return 0;
}

Compilation message

akcija.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization("O3")
      | 
akcija.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization("unroll-loops")
      | 
akcija.cpp:6: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    6 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 12 ms 2004 KB Output is correct
7 Correct 9 ms 2004 KB Output is correct
8 Correct 9 ms 2036 KB Output is correct
9 Correct 14 ms 2004 KB Output is correct
10 Correct 15 ms 2036 KB Output is correct