# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590607 | 2022-07-06T07:25:32 Z | UncoolAnon | Bubble Sort 2 (JOI18_bubblesort2) | C++14 | 151 ms | 536 KB |
#include <bits/stdc++.h> #define pii pair<int,int> #define F first #define S second #define mp make_pair #define endl '\n' using namespace std; const int inf=1e9,N=2e5+5,md=1e9+7; vector<int> countScans(vector<int> a ,vector<int> x , vector<int> v){ vector<int> answer(x.size()); for(int i=0;i<x.size();i++){ a[x[i]]=v[i]; int mn=1e9+1; for(int j=a.size()-1;j>-1;--j){ if(a[j]>mn) ++answer[i]; else mn=a[j]; } } return answer; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 151 ms | 536 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |