oj.uz

Submission #658433

# Submission time Handle Problem Language Result Execution time Memory
658433 2022-11-13T08:03:06 Z Nhoksocqt1 Akcija (COCI15_akcija) C++17
80 / 80
 15 ms 1280 KB 
#include<bits/stdc++.h>
using namespace std;

#define inf 0x3f3f3f3f
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define fi first
#define se second
#define N 100005
typedef long long ll;
typedef pair<int, int> ii;

template<class X, class Y>
	inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
	inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
    return uniform_int_distribution<int>(l, r)(rng);
}

int readInt() {
	bool minus = false;
	int result = 0;
	char ch;
	ch = getchar();
	while(true) {
		if(ch == '-') break;
		if(ch >= '0' && ch <= '9') break;
		ch = getchar();
	}

	if(ch == '-') minus = true; else result = ch - '0';
	while(true) {
		ch = getchar();
		if (ch < '0' || ch > '9') break;
		result = result * 10 + (ch - '0');
	}

	if(minus)
		return -result;
	else
		return result;
}

int cost[N], numBook;

void process() {
    cin >> numBook;
    for (int i = 1; i <= numBook; ++i) {
        cin >> cost[i];
    }

    sort(cost + 1, cost + numBook + 1);
    reverse(cost + 1, cost + numBook + 1);

    ll res(0);
    for (int i = 1; i <= numBook; ++i) {
        if(i % 3 != 0) {
            res += cost[i];
        }
    }

    cout << res;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//    freopen("akcija.inp", "r", stdin);
//    freopen("akcija.out", "w", stdout);

    process();
    return 0;
}

Compilation message

akcija.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("O3")
      | 
akcija.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization ("unroll-loops")
      |

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 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 11 ms 1068 KB Output is correct
7 Correct 7 ms 1104 KB Output is correct
8 Correct 7 ms 1088 KB Output is correct
9 Correct 15 ms 1280 KB Output is correct
10 Correct 15 ms 1236 KB Output is correct