Submission #199367

#TimeUsernameProblemLanguageResultExecution timeMemory
199367mahmoudbadawyBubble Sort 2 (JOI18_bubblesort2)C++17
38 / 100
9093 ms1864 KiB
#include "bubblesort2.h" #include <bits/stdc++.h> #define F first #define S second using namespace std; const int N=500005; pair<int,int> arr[N]; vector<int> countScans(vector<int> A,vector<int> X,vector<int> V) { int n=A.size(); vector<int> v; for(int i=0;i<X.size();i++) { A[X[i]]=V[i]; for(int i=0;i<n;i++) { arr[i].F=A[i]; arr[i].S=i; } sort(arr,arr+n); int ans=0; for(int i=0;i<n;i++) ans=max(ans,max(arr[i].S-i,0)); v.push_back(ans); } return v; }

Compilation message (stderr)

bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:15:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<X.size();i++)
              ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...