제출 #143621

#제출 시각아이디문제언어결과실행 시간메모리
143621shashwatchandraBubble Sort 2 (JOI18_bubblesort2)C++17
0 / 100
9018 ms2520 KiB
#include "bubblesort2.h" #include <bits/stdc++.h> using namespace std; #define REP(i,n) for(int i = 0;i < n;i++) vector<int> countScans(vector<int> a,vector<int> x,vector<int> v){ vector<int> answer; REP(i,x.size()){ a[x[i]] = v[i]; int ans = 0; int ind = 0; REP(i,a.size()){ if(a[ind] >= a[i])ind = i; } REP(i,ind){ if(a[i] > a[ind])ans++; } answer.push_back(ans); } return answer; }

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

bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:6:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,n) for(int i = 0;i < n;i++)
bubblesort2.cpp:10:6:
  REP(i,x.size()){
      ~~~~~~~~~~                   
bubblesort2.cpp:10:2: note: in expansion of macro 'REP'
  REP(i,x.size()){
  ^~~
bubblesort2.cpp:6:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,n) for(int i = 0;i < n;i++)
bubblesort2.cpp:14:7:
   REP(i,a.size()){
       ~~~~~~~~~~                  
bubblesort2.cpp:14:3: note: in expansion of macro 'REP'
   REP(i,a.size()){
   ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...