제출 #1079987

#제출 시각아이디문제언어결과실행 시간메모리
1079987Trumling정렬하기 (IOI15_sorting)C++14
0 / 100
1 ms604 KiB
#include "sorting.h" #include<bits/stdc++.h> using namespace std; #define F first #define S second #define pb push_back #define all(x) x.begin(),x.end() #define INF 9999999999999999 typedef long long ll; int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) { vector<pair<ll,ll>>v; for(int i=0;i<M;i++) v.pb({P[i],Q[i]}); sort(all(v)); vector<int>s(N); ll r=0; do { for(int i=0;i<N;i++) s[i]=S[i]; for(int i=0;i<M;i++) { swap(s[v[i].F],s[v[i].S]); bool tf=1; for(int j=0;j<N-1;j++) if(s[j]>s[j+1]) { tf=0; break; } if(tf) { r=i+1; break; } } if(r!=0) break; } while (next_permutation(all(v))); for(int i=0;i<r;i++) { //P[i]=v[i].F; //Q[i]=v[i].S; } return r; }

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

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:56:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   56 |  return r;
      |         ^
sorting.cpp:12:46: warning: unused parameter 'X' [-Wunused-parameter]
   12 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                          ~~~~^~~
sorting.cpp:12:55: warning: unused parameter 'Y' [-Wunused-parameter]
   12 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                   ~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...