답안 #885838

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
885838	2023-12-10T20:55:38 Z	JakobZorz	정렬하기 (IOI15_sorting)	C++17	16 / 100	7 ms	604 KB

sorting

#include"sorting.h"
#include<iostream>
#include<vector>
using namespace std;

int n;
int*x,*y,*s;

vector<pair<int,int>>construct(int m){
    vector<pair<int,int>>ans(m);
    vector<int>perm(n),curr(n);
    for(int i=0;i<n;i++){
        perm[i]=i;
        curr[i]=s[i];
    }
    
    for(int i=0;i<m;i++)
        swap(curr[x[i]],curr[y[i]]);
    
    for(int i=m-1;i>=0;i--)
        swap(perm[x[i]],perm[y[i]]);
    
    for(int i=0;i<m;i++){
        swap(perm[x[i]],perm[y[i]]);
        for(int j=0;j<n;j++){
            if(curr[j]!=j){
                ans[i].first=perm[j];
                for(int k=0;k<n;k++){
                    if(curr[k]==j){
                        swap(curr[j],curr[k]);
                        ans[i].second=perm[k];
                        break;
                    }
                }
                break;
            }
        }
    }
    
    return ans;
}

int findSwapPairs(int N,int S[],int M,int X[],int Y[],int P[],int Q[]){
    n=N;
    x=X;
    y=Y;
    s=S;
    
    vector<pair<int,int>>res=construct(3*n);
    for(int i=0;i<3*n;i++){
        P[i]=res[i].first;
        Q[i]=res[i].second;
    }
    
	return 3*n;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:43:37: warning: unused parameter 'M' [-Wunused-parameter]
   43 | int findSwapPairs(int N,int S[],int M,int X[],int Y[],int P[],int Q[]){
      |                                 ~~~~^

Subtask #1
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	344 KB	Integer parameter [name=R] equals to 3, violates the range [0, 1]
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	344 KB	Integer parameter [name=R] equals to 3, violates the range [0, 1]
2	Halted	0 ms	0 KB	-

Subtask #3
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct