This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
// #define int long long
typedef long long ll ;
const ll ooo = 1e14 ;
const ll oo = 2e9 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7 ;
const int N = 10000010 ;
int n ;
vector<pair<int , int >> v;
// bool cn(auto a , auto b){
// if(abs(a.first) == abs(b.first)){
// if(a.first == b.first) return a
// }
// }
ll count_swaps(vector<int> s) {
n = s.size();
for(int i = 0 ; i < n ; ++i){
v.push_back({s[i] , i});
}
return (s[0] == -1 ? 0ll : 1ll) ;
// sort(v.begin(), v.end() , cn);
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |