oj.uz

답안 #484049

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
484049 2021-11-02T01:38:42 Z Cross_Ratio 정렬하기 (IOI15_sorting) C++14
20 / 100
 1 ms 332 KB 



#include <bits/stdc++.h>
#include "sorting.h"
using namespace std;
typedef pair<long long int, int> P;
vector<P> So;
vector<long long int> S;
vector<int> X, Y;
vector<long long int> idx;
inline int id(long long int n) {
    return lower_bound(idx.begin(),idx.end(),n)-idx.begin();
}
int N;
int findSwapPairs(int N2, int S2[], int M, int X2[], int Y2[], int P1[], int P2[]) {
    N = N2;
    int i, j;
    for(i=0;i<N;i++) {
        S.push_back(S2[i]);
        X.push_back(X2[i]);
        Y.push_back(Y2[i]);
    }
    for(i=0;i<N;i++) {
        S[i] = N * S[i] + i;
        idx.push_back(S[i]);
    }
    sort(idx.begin(),idx.end());
    vector<int> Sk;
    Sk.resize(N);
    for(i=0;i<N;i++) Sk[id(S[i])] = i;
/*
    for(i=0;i<N;i++) cout << Sk[i] << ' ';
    cout << '\n';
*/
    int cnt = 0;
    for(i=0;i<N;i++) {
        if(i == Sk[i]) continue;
        P1[cnt] = i;
        P2[cnt] = Sk[i];
        swap(S[i],S[Sk[i]]);
        Sk[id(S[P1[cnt]])] = P1[cnt];
        Sk[id(S[P2[cnt]])] = P2[cnt];
        cnt++;
/*
        for(int j=0;j<N;j++) cout << S[j]/N << ' ';
        cout << '\n';
        for(int j=0;j<N;j++) cout << Sk[j] << ' ';
        cout << "\n\n";
*/
    }

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

    return cnt;
}

Compilation message

sorting.cpp: In function 'int id(long long int)':
sorting.cpp:14:48: warning: conversion from '__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
   14 |     return lower_bound(idx.begin(),idx.end(),n)-idx.begin();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:19:12: warning: unused variable 'j' [-Wunused-variable]
   19 |     int i, j;
      |            ^
sorting.cpp:17:41: warning: unused parameter 'M' [-Wunused-parameter]
   17 | int findSwapPairs(int N2, int S2[], int M, int X2[], int Y2[], int P1[], int P2[]) {
      |                                     ~~~~^

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Incorrect 0 ms 204 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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