# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
937256 | Litusiano | Gym Badges (NOI22_gymbadges) | C++17 | 2053 ms | 8280 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
mt19937 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
bool cmp(pair<int,int> a, pair<int,int> b){
return a.second-a.first > b.second-b.first;
}
void shuffle(vector<pair<int,int>>& v){
int n = v.size();
for(int i = 0; i<3*n; i++){
int a = rng()%n; int b = rng()%n;
swap(v[a],v[b]);
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n; cin>>n;
vector<pair<int,int>> v(n); for(auto& i : v) cin>>i.first;
for(auto& i :v) cin>>i.second;
// sort(v.begin(),v.end(),cmp);
// for(auto x : v) cout<<x.first<<" "<<x.second<<endl;
if(n > 5000){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |