oj.uz

Submission #140452

# Submission time Handle Problem Language Result Execution time Memory
140452 2019-08-03T06:33:10 Z PedroBigMan Sorting (IOI15_sorting) C++14
0 / 100
 3 ms 376 KB 
#include "sorting.h"
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) 
{
    ll c1,c2;
    REP(i,0,M)
    {
        c1 = S[X[i]]; c2 = S[Y[i]];
        S[X[i]] = c2; S[Y[i]] = c1;
    }
    vector<ll> pos;
    REP(i,0,N) {pos.pb(0);}
    REP(i,0,N) {pos[S[i]]=i;}
    ll last=0;
    if(Y[0]==0)
    {
        REP(i,0,N)
        {
            if(pos[i]!=i)
            {
                P[last] = i; Q[last] = pos[i];
                c1 = S[i]; c2 = S[pos[i]];
                S[i] = c2; S[pos[i]] = c1;
                pos[i] = i; pos[c1] = Q[last];
                last++;
            }
        }
        P[last]=1; Q[last]=1;
        return (last+1);
    }
    else 
    {
        c1 =S[0]; c2=S[1]; S[0]=c1; S[1]=c2;
        if(pos[0]!=0)
        {
            P[0]=0; Q[0]=pos[0];
            last++;
            c1 =S[0]; c2=S[1]; S[0]=c1; S[1]=c2;
        }
        if(pos[1]!=1)
        {
            P[last]=1; Q[last] = pos[1];
            last++;
            c1 =S[0]; c2=S[1]; S[0]=c1; S[1]=c2;
        }
        REP(i,2,N)
        {
            if(pos[i]!=i)
            {
                P[last] = i; Q[last] = pos[i];
                c1 = S[i]; c2 = S[pos[i]];
                S[i] = c2; S[pos[i]] = c1;
                pos[i] = i; pos[c1] = Q[last];
                last++;
                c1 =S[0]; c2=S[1]; S[0]=c1; S[1]=c2;
            }
        }
        if(pos[0]==0) {return last;}
        else {P[last]=0; Q[last]=0; return (last+1);}
        
    }
}

/*int main()
{
    ll N,M; cin>>N>>M; int S[N]; REP(i,0,N) {cin>>S[i];}
    int X[M],Y[M]; REP(i,0,M) {cin>>X[i]>>Y[i];}
    int P[M], Q[M]; 
    cout<<findSwapPairs(N,S,M,X,Y,P,Q)<<endl;
}*/

Compilation message

sorting.cpp: In function 'void Out(std::vector<int>)':
sorting.cpp:11:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
sorting.cpp:20:29:
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                             ~~~~~~~~~~~~
sorting.cpp:20:25: note: in expansion of macro 'REP'
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                         ^~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer 1 violates the range [0, 0]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer 1 violates the range [0, 0]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer 1 violates the range [0, 0]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -