Submission #234365

#	Time	Username	Problem	Language	Result	Execution time	Memory
234365		kartel	COCI17_cezar (COCI17_cezar)	C++14	50 / 50	6 ms	384 KiB

cezar

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int mp[200];
int sum, x, i, n;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;
    for (i = 2; i <= 13; i++) mp[i] = 4;

    for (i = 1; i <= n; i++)
    {
        cin >> x;
        sum += x;
        mp[x]--;
    }

    x = 21 - sum;

    sum = 0;

    i = x + 1;
    while (i <= 13) sum += mp[i++];

    i = x;
    while (i >= 2) sum -= mp[i], i--;

    if (sum < 0) cout << "VUCI";
            else cout << "DOSTA";
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5