oj.uz

답안 #60150

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
60150 2018-07-23T19:23:55 Z dukati8 정렬하기 (IOI15_sorting) C++14
74 / 100
 1000 ms 9412 KB 
#include "sorting.h"
#include <bits/stdc++.h>
#define rep(i,a,b) for (int i=a; i<int(b); i++)
using namespace std;

vector<pair<int, int> > moves;
int movestofix(int Ii[],int Ss[], int N) {
  int I[N], S[N];
  rep (i,0,N) { I[i]=Ii[i];S[i]=Ss[i];}
  moves.clear();
  //I[i] is not value at i, but index of value i in S
  int counter=0;
  rep(i,0,N) {
    if (S[i]==i) continue;
    counter++;
    int a,b;
    a=i;
    b=I[i];
    //a och b byter plats
    int sa,sb;
    sa=S[a];
    sb=S[b];
    moves.push_back(make_pair(a,b));
    S[a]=sb;
    S[b]=sa;
    I[sa]=b;
    I[sb]=a;

  }
  moves.push_back(make_pair(0,0));
  return counter;
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
  int I[N];
  rep (i,0,N) {
    I[S[i]]=i;
  }
  int i=0;
  while (movestofix(I,S,N)>i) {

    int a,b;
    a=X[i];
    b=Y[i];
    //a och b byter plats
    int sa,sb;
    sa=S[a];
    sb=S[b];
    S[a]=sb;
    S[b]=sa;
    I[sa]=b;
    I[sb]=a;
    i++;
  }
  rep (j,0,N) {S[j]=j;I[j]=j;}

  for (int j=i-1;j>=0; j--) {
    P[j]=S[moves[j].first];
    Q[j]=S[moves[j].second];
    //swap(switches[X[j]],switches[Y[j]]);
    int a,b;
    a=I[X[j]];
    b=I[Y[j]];
    //a och b byter plats
    int sa,sb;
    sa=S[a];
    sb=S[b];
    S[a]=sb;
    S[b]=sa;
    I[sa]=b;
    I[sb]=a;
  }
  return i;
}

Compilation message

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

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Correct 3 ms 256 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 304 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 6 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 3 ms 432 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 384 KB Output is correct
2 Correct 47 ms 504 KB Output is correct
3 Correct 41 ms 472 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 13 ms 512 KB Output is correct
8 Correct 48 ms 504 KB Output is correct
9 Correct 51 ms 384 KB Output is correct
10 Correct 42 ms 384 KB Output is correct
11 Correct 35 ms 384 KB Output is correct
12 Correct 15 ms 452 KB Output is correct
13 Correct 27 ms 476 KB Output is correct
14 Correct 3 ms 384 KB Output is correct

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 384 KB Output is correct
2 Correct 47 ms 504 KB Output is correct
3 Correct 41 ms 472 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 13 ms 512 KB Output is correct
8 Correct 48 ms 504 KB Output is correct
9 Correct 51 ms 384 KB Output is correct
10 Correct 42 ms 384 KB Output is correct
11 Correct 35 ms 384 KB Output is correct
12 Correct 15 ms 452 KB Output is correct
13 Correct 27 ms 476 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Execution timed out 1077 ms 9412 KB Time limit exceeded
16 Halted 0 ms 0 KB -