oj.uz

답안 #1079995

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079995 2024-08-29T05:53:31 Z Trumling 정렬하기 (IOI15_sorting) C++14
0 / 100
 1 ms 508 KB 
    #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[]) {
     
    	ll pos[N];
        for(int i=0;i<N;i++)
		{
			pos[S[i]]=i;
		}
    		
		
    	// for(int i=0;i<N;i++)
		// 	cout<<pos[i]<<' ';

		// 	cout<<'\n';
    	for(int i=0;i<N;i++)
    	{
    		P[i]=pos[i];
    		Q[i]=i;

			pos[S[i]]=pos[i];
			S[pos[i]]=S[i];

			S[i]=i;
			pos[i]=i;
			
    	}

		// for(int i=0;i<N;i++)
		// 	cout<<S[i]<<' ';

     
    	return N;
    }

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:27:17: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   27 |       P[i]=pos[i];
      |            ~~~~~^
sorting.cpp:12:43: warning: unused parameter 'M' [-Wunused-parameter]
   12 |     int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                       ~~~~^
sorting.cpp:12:50: 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:59: warning: unused parameter 'Y' [-Wunused-parameter]
   12 |     int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                       ~~~~^~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 508 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 508 KB Output isn't correct
2 Halted 0 ms 0 KB -