oj.uz

Submission #140445

# Submission time Handle Problem Language Result Execution time Memory
140445 2019-08-03T05:25:24 Z PedroBigMan Sorting (IOI15_sorting) C++14
0 / 100
 3 ms 504 KB 
#include "sorting.h"
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef long long 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;}
    REP(i,0,N)
    {
        P[i] = i; Q[i] = pos[i];
        c1 = S[i]; c2 = S[pos[i]];
        S[i] = c2; S[pos[i]] = c1;
        pos[i] = i; pos[c1] = Q[i];
    }
    REP(i,N,M) {P[i]=0; Q[i]=0;}
    return M;
}

Compilation message

sorting.cpp: In function 'void Out(std::vector<long long 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;}
                         ^~~
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:28:19: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         S[X[i]] = c2; S[Y[i]] = c1;
                   ^~
sorting.cpp:28:33: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         S[X[i]] = c2; S[Y[i]] = c1;
                                 ^~
sorting.cpp:35:16: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         P[i] = i; Q[i] = pos[i];
                ^
sorting.cpp:35:31: warning: conversion to 'int' from '__gnu_cxx::__alloc_traits<std::allocator<long long int> >::value_type {aka long long int}' may alter its value [-Wconversion]
         P[i] = i; Q[i] = pos[i];
                               ^
sorting.cpp:37:16: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         S[i] = c2; S[pos[i]] = c1;
                ^~
sorting.cpp:37:32: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         S[i] = c2; S[pos[i]] = c1;
                                ^~

Subtask #1
0 / 8.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 504 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 504 KB Output isn't correct
2 Halted 0 ms 0 KB -