제출 #234662

#제출 시각아이디문제언어결과실행 시간메모리
234662LittleFlowers__Bubble Sort 2 (JOI18_bubblesort2)C++17
0 / 100
9083 ms640 KiB
#include <bits/stdc++.h> #include "bubblesort2.h" using namespace std; vector<int> countScans(vector<int> a,vector<int> x,vector<int> v){ vector<int> res; for(int i=0;i<x.size();++i){ a[x[i]]=v[i]; vector<int> b=a; for(int ans=0;;){ int has=0; for(int j=1;j<a.size();++j){ if(b[j-1]>b[j]){} has=1; swap(b[j-1],b[j]); } if(!has){ res.push_back(ans); break; } ++ans; } } return res; }

컴파일 시 표준 에러 (stderr) 메시지

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