oj.uz

Submission #143091

# Submission time Handle Problem Language Result Execution time Memory
143091 2019-08-13T01:16:01 Z daniel920712 Arranging Shoes (IOI19_shoes) C++14
10 / 100
 1000 ms 3056 KB 
#include <iostream>
#include <stdio.h>
#include <vector>

using namespace std;
long long count_swaps(std::vector<int> S)
{
    vector<int> S1;
    long long ans1=0,ans2=0,N=S.size(),i,j,k;
    int t;
    for(i=0;i<N;i++) S1.push_back(S[i]);
    for(i=0;i<N/2;i++)
    {
        for(j=2*i;j<N;j++)
        {
            if(S[j]<0)
            {
                ans1+=(j-2*i);
                t=0-S[j];
                for(k=j;k>2*i;k--) swap(S[k],S[k-1]);
                break;
            }
        }
        for(j=2*i+1;j<N;j++)
        {
            if(S[j]==t)
            {
                ans1+=(j-2*i-1);
                for(k=j;k>2*i+1;k--) swap(S[k],S[k-1]);
                break;
            }
        }

    }

    for(i=0;i<N/2;i++)
    {
        for(j=N-2*i-1;j>=0;j--)
        {
            if(S1[j]>0)
            {
                ans2+=(N-2*i-j);
                t=0-S1[j];
                for(k=j;k<N-2*i-1;k++) swap(S1[k],S1[k+1]);
                break;
            }
        }
        for(j=N-2*i-2;j>=0;j--)
        {
            if(S1[j]==t)
            {
                ans2+=(N-2*i-1-j);
                for(k=j;k<N-2*i-2;k++) swap(S1[k],S1[k+1]);
                break;
            }
        }

    }
    //ans1=(N/2)*(N/2-1)/2;
    return min(ans1,ans2);
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:26:13: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if(S[j]==t)
             ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 304 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Incorrect 2 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 424 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 252 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 7 ms 632 KB Output is correct
21 Correct 7 ms 632 KB Output is correct
22 Correct 61 ms 3028 KB Output is correct
23 Correct 28 ms 3056 KB Output is correct
24 Correct 36 ms 3028 KB Output is correct
25 Execution timed out 1082 ms 3028 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 280 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Execution timed out 1089 ms 3056 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 304 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Incorrect 2 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 304 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Incorrect 2 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -