Submission #365468

#TimeUsernameProblemLanguageResultExecution timeMemory
365468ssenseMean (info1cup19_mean)C++14
0 / 100
1 ms492 KiB
#include <bits/stdc++.h> #define startt ios_base::sync_with_stdio(false);cin.tie(0); #pragma GCC target ("avx2") #pragma GCC optimization ("O3") #pragma GCC optimization ("unroll-loops") typedef unsigned long long ull; typedef long long ll; using namespace std; #define FOR(n) for(int i=0;i<n;i++) #define vt vector #define vint vector<int> #define all(v) v.begin(), v.end() #define MOD 1000000007 #define MOD2 998244353 #define MX 1000000000 #define nax 100005 #define MXL 1000000000000000000 #define PI 3.14159265 #define pb push_back #define pf push_front #define sc second #define fr first #define int ll #define endl '\n' #define ld long double int ceildiv(int one, int two) { if (one % two == 0) {return one / two;} else {return one / two + 1;} } int power(int n, int pow, int m) { if (pow == 0) return 1; if (pow % 2 == 0) { ll x = power(n, pow / 2, m); return (x * x) % m; } else return (power(n, pow - 1, m) * n) % m; } int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b); } int factorial(int n, int mod) { if (n > 1) return (n * factorial(n - 1, mod)) % mod; else return 1; } int lcm(int a, int b) { return (a * b) / gcd(a, b); } vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}vector<vector<int>> adj;void init(int n) {for (int i = 0; i <= n; i++) { vector<int> a; adj.pb(a);}} int32_t main(){ startt; //freopen("algsort.in", "r", stdin); //freopen("algsort.out", "w", stdout); int n; cin >> n; vint a = read(n); for(int i = 0; i < n-1; i++) { int pos = 0; int mn = MX; for(int j = 0; j < a.size()-1; j++) { if(a[i]+a[i+1] < mn) { mn = a[i]+a[i+1]; pos = i; } } a[pos+1] = mn/2; a.erase(a.begin()+pos-1); } cout << a[0] << endl; }

Compilation message (stderr)

mean.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
mean.cpp:5: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      | 
mean.cpp: In function 'int32_t main()':
mean.cpp:61:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |   for(int j = 0; j < a.size()-1; j++)
      |                  ~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...