oj.uz

Submission #473445

# Submission time Handle Problem Language Result Execution time Memory
473445 2021-09-15T14:19:48 Z Beboo44 COCI17_cezar (COCI17_cezar) C++14
50 / 50
 1 ms 328 KB 
#include <bits/stdc++.h>
using namespace std;
#define all(v)			((v).begin()), ((v).end())
#define sz(v)			((int)((v).size()))
typedef long long ll;
typedef vector<int> vi;
typedef vector<pair<ll , int> > vpli;
typedef set<char> st;
typedef stack<int> s;
typedef deque<int> dq;
typedef queue<int> q;
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0)
 
 
int main()
{
   ll n;
   cin>>n;
   ll arr[12]={0};
   for(int i=2; i<=12; ++i){
    arr[i]=4;
   }
   arr[10]+=12;
 
   vector<ll>v(n);
   ll sum=0;
   for(int i=0; i<n; ++i){
    cin>>v[i];
    arr[v[i]]--;
    sum+=v[i];
   }
   ll ans= 21-sum;
   ll sum1=0;
   
 
   for(int i=ans+1; i<12; ++i){
    sum1+=arr[i];
   }
   ll sum2 = 52-n-sum1;
   if(sum1>=sum2){
    cout<<"DOSTA";
   }
   else{
    cout<<"VUCI";
   }
 
 
 
 
 
    return 0;
}

Compilation message

cezar.cpp: In function 'int main()':
cezar.cpp:21:11: warning: iteration 10 invokes undefined behavior [-Waggressive-loop-optimizations]
   21 |     arr[i]=4;
      |     ~~~~~~^~
cezar.cpp:20:18: note: within this loop
   20 |    for(int i=2; i<=12; ++i){
      |                 ~^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 208 KB Output is correct