Submission #1239763

#TimeUsernameProblemLanguageResultExecution timeMemory
1239763M_SH_OGroup Photo (JOI21_ho_t3)C++20
0 / 100
0 ms324 KiB
/*#pragma GCC optimize("O3") #pragma GCC optimization("Ofast,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>*/ #define ll long long #define ll1 long long #define ull unsigned long long #define dou long double #define str string #define vll vector<ll> #define vi vector<int> #define pll pair<ll, ll> #define vpll vector<pll> #define vbool vector<bool> #define vstr vector<str> #define vvll vector<vll> #define pb push_back #define pf push_front #define endl "\n" #define fr first #define se second // #define sortcmp(a) sort(a.begin(), a.end(), cmp) #define sort(a) sort(a.begin(), a.end()) #define reverse(a) reverse(a.begin(), a.end()) #define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0) #define INF 1000000000000000007 #define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> using namespace std; //using namespace __gnu_pbds; mt19937 rng(time(0)); ll randll(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rng); } int main(){ speed; srand(time(0)); ll n, m; cin >> n; vll a(n); for (int i =0 ; i < n ;i ++) { cin >> a[i]; } vll b; b.pb(a[0]); ll res = 0; for (int i = 1; i < n; i ++) { ll x = -1; for (int j = b.size()-1; j >= 0; j --) { if (b[j] < a[i]+2) { x = j; break; } } res += b.size()-1-x; vll c; if (x == -1) c.pb(a[i]); for (int j = 0; j < b.size(); j ++) { c.pb(b[j]); if (j == x) c.pb(a[i]); } b = c; } cout << res << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...