이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define print(v,r) f(i,0,r) cout<<v[i]<<" "; cout<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define Add(x,y) x=(x+y)%mod
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
const int N=1e6+99;
int n,t,a[N];
vector<int> g[N];
int main(){
cin>>n;
f(i,1,n+1){
cin>>a[i];
g[i/2].pb(i);
}
f(i,1,n+1){
pair<int,int> mn=mp(a[i],-1);
sort(g[i].begin(),g[i].end());
f(j,0,g[i].size()){
minm(mn,mp(a[g[i][j]],j));
}
if(mn.S==-1) continue;
swap(a[i],a[g[i][mn.S]]);
f(j,1,mn.S+1){
g[g[i][0]].pb(g[i][j]);
}
}
f(i,1,n+1){
cout<<a[i]<<" ";
}
}
컴파일 시 표준 에러 (stderr) 메시지
swap.cpp: In function 'int main()':
swap.cpp:7:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
7 | #define f(i,a,b) for(int i=a;i<b;i++)
......
34 | f(j,0,g[i].size()){
| ~~~~~~~~~~~~~~~
swap.cpp:34:3: note: in expansion of macro 'f'
34 | f(j,0,g[i].size()){
| ^
# | 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... |