제출 #1288630

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1288630		aritro_	Cezar (COCI17_cezar)	C++20	45 / 50	1 ms	580 KiB

cezar

#include<bits/stdc++.h>
using namespace std;

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template <typename T> using ordset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

/*
less<T> can be changed to:
1. less_equal<T>
2. greater<T>

ordered_set functions:
1. *(os.find_by_order(x)) -> return the value at position x (0 base)
2. os.order_of_key(x) -> return the number of elements less than x
*/

typedef long long ll;
#define int ll
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()

const int MOD=1000000007;

#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))

#define fios(); ios_base::sync_with_stdio(0);cin.tie(0);
#define fraction(x); cout.unsetf(ios::floatfield); cout.precision(x); cout.setf(ios::fixed,ios::floatfield);
#define file(); freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);

void solve(){
    map<int,int>fre; //val,fre
    for(int i=1;i<=11;i++) fre[i]=4;
    fre[10]=12;
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++) cin>>a[i];
    int tot=0;
    for(int i=0;i<n;i++) fre[a[i]]--,tot+=a[i];
    int need=21-tot;
    int small=0;
    for(int i=1;i<=need;i++) small+=fre[i];
    int big=0;
    for(int i=need+1;i<=100;i++) big+=fre[i];
    if(small>=big) cout<<"VUCI"<<endl;
    else cout<<"DOSTA"<<endl;
    return;
}

int32_t main(){
    fios();
    //file();

    int t=1;
    //cin>>t;
    for(int tc=1;tc<=t;tc++){
        //cout<<"Case "<<tc<<": ";
        solve();
    }
    return 0; 
}

• 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: 0 / 5
• Subtask 10: 5 / 5