Submission #1273948

#TimeUsernameProblemLanguageResultExecution timeMemory
1273948almazArranging Shoes (IOI19_shoes)C++20
10 / 100
1 ms348 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; // #define int long long // #define endl '\n' #define ff first #define ss second #define pb push_back #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define ar array const int MOD = 1e9 + 7, N = 2e5 + 5; long long INF = 1e18; long long count_swaps(std::vector<int> s) { int n = s.size(); long long ans = 0; vector <int> b; for(int i = 0;i < n;i += 2){ if(s[i] > 0 && s[i + 1] < 0){ ans++; } if(s[i] == s[i + 1]){ int x; if(s[i] < 0){ x = i + 1; } else{ x = i; } b.pb(x); } } for(int i = 0;i < (int)b.size();i += 2){ ans += b[i + 1] - b[i]; } return (ans); }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...