Submission #234372

#	Time	Username	Problem	Language	Result	Execution time	Memory
234372		Vimmer	COCI17_cezar (COCI17_cezar)	C++14	50 / 50	6 ms	512 KiB

cezar

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")

#define sz(x) ll(x.size())
#define base 1000000
#define M ll(1e9+7)
#define N 100005
#define F first
#define S second
#define pb push_back
#define in insert
#define eb emplace_back
#define ed "\n"

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef short int si;

//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;




int kol[20];

int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    int sm = 0;

    for (int i = 0; i < n; i++)
    {
        int x;

        cin >> x;

        kol[x]++;

        sm += x;
    }

    int x = 21 - sm;

    int k1 = 0, k2 = 0;

    for (int i = 2; i <= 11; i++)
    {
        if (i <= x) k1 += (i == 10 ? 12 : 4) - kol[i];
          else k2 += (i == 10 ? 12 : 4) - kol[i];
    }

    if (k1 > k2) cout << "VUCI" << endl;
      else cout << "DOSTA" << endl;
}

• 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