oj.uz

답안 #623708

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
623708 2022-08-06T10:54:16 Z Ferid20072020 Autići (COCI22_autici) C++14
50 / 50
 12 ms 1108 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")


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



using namespace __gnu_pbds;
using namespace std;
using namespace chrono;
// using namespace atcoder



#define YES             cout << "YES"
#define NO              cout << "NO"
#define fd              fixed
#define ll              long long
#define ull             unsigned long long
#define ui              unsigned int
#define dbl             double
#define ld              long double
#define f               first
#define s               second
#define pii             pair<int , int>
#define pll             pair<ll , ll>
#define pil             pair<int , ll>
#define pli             pair<ll , int>
#define psi             pair<string , int>
#define pci             pair<char , int>
#define pic             pair<int , char>
#define pis             pair<int , string>
#define psl             pair<string , ll>
#define pcl             pair<char , ll>
#define plc             pair<ll , char>
#define pls             pair<ll , string>
#define pb              push_back
#define eb              emplace_back
#define mp              make_pair
#define ins             insert
#define END             return 0
#define speed           ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define all(x)          (x).begin() , (x).end()
#define oo              1e9 + 5


/*
int gcd(int number1 , int number2){
   if(number2 == 0){
      return number1;
   }
   return gcd(number2 , number1 % number2);
}

int lcm(int number1 , int number2){
   return number1 / gcd(number1 , number2) * number2;
}

ll fact(int number){
   ll product = 1;
   for(int i=2 ; i<=number ; i++){
      product *= i;
   }
   return product;
}
*/


#define int ll



void solve(){
   int n;
   cin >> n;
   vector<int> A(n);

   int Min = oo , Ind;
   for(int i=0 ; i<n ; i++){
      cin >> A[i];
      if(A[i] < Min){
         Min = A[i];
         Ind = i;
      }
   }

   int ans = 0;
   for(int i=0 ; i<n ; i++){
      if(i != Ind){
         ans += (Min + A[i]);
      }
   }
   cout << ans << '\n';
}

signed main(){
   speed;

   int t = 1;
   //cin >> t;

   while(t--){
      solve();
   }

   END;
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:92:7: warning: 'Ind' may be used uninitialized in this function [-Wmaybe-uninitialized]
   92 |       if(i != Ind){
      |       ^~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 5 ms 980 KB Output is correct
3 Correct 12 ms 980 KB Output is correct
4 Correct 8 ms 980 KB Output is correct
5 Correct 10 ms 1108 KB Output is correct
6 Correct 8 ms 980 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 216 KB Output is correct
8 Correct 0 ms 224 KB Output is correct
9 Correct 0 ms 220 KB Output is correct
10 Correct 1 ms 224 KB Output is correct
11 Correct 1 ms 220 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 5 ms 980 KB Output is correct
3 Correct 12 ms 980 KB Output is correct
4 Correct 8 ms 980 KB Output is correct
5 Correct 10 ms 1108 KB Output is correct
6 Correct 8 ms 980 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 216 KB Output is correct
14 Correct 0 ms 224 KB Output is correct
15 Correct 0 ms 220 KB Output is correct
16 Correct 1 ms 224 KB Output is correct
17 Correct 1 ms 220 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 224 KB Output is correct
21 Correct 5 ms 980 KB Output is correct
22 Correct 12 ms 980 KB Output is correct
23 Correct 9 ms 1108 KB Output is correct
24 Correct 8 ms 980 KB Output is correct
25 Correct 9 ms 980 KB Output is correct
26 Correct 9 ms 980 KB Output is correct
27 Correct 10 ms 980 KB Output is correct
28 Correct 8 ms 980 KB Output is correct
29 Correct 10 ms 980 KB Output is correct
30 Correct 12 ms 980 KB Output is correct