oj.uz

Submission #143417

# Submission time Handle Problem Language Result Execution time Memory
143417 2019-08-14T00:36:51 Z daniel920712 Arranging Shoes (IOI19_shoes) C++14
10 / 100
 4 ms 504 KB 
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <assert.h>

using namespace std;
int S1[1005];
int all[1005];
bool F(int a,int b)
{
    return a<b;
}
long long count_swaps(std::vector<int> S)
{
    long long ans1=0,ans2=0,ans3=0,ans4=0,N=S.size(),i,j,k,now=0;
    long long t;
    now=0;
    for(i=0;i<N;i++) S1[i]=S[i];
    for(i=0;i<N;i++) if(S1[i]>0) all[now++]=S1[i];
    for(i=0;i<N/2;i++)
    {
        for(j=2*i;j<N;j++)
        {
            if(S1[j]==0-all[i])
            {
                for(k=j;k>2*i;k--)
                {
                    ans1++;
                    swap(S1[k],S1[k-1]);

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

        }
    }

    for(i=0;i<N;i++) S1[i]=S[i];
    for(i=0;i<N/2;i++)
    {
        for(j=N-2*i-1;j>=0;j--)
        {
            if(S1[j]==all[i])
            {
                for(k=j;k<N-2*i-1;k++)
                {
                    ans3++;
                    swap(S1[k],S1[k+1]);

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

        }
    }

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

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

        }
    }

    for(i=0;i<N;i++) S1[i]=S[i];
    for(i=0;i<N/2;i++)
    {
        for(j=N-2*i-1;j>=0;j--)
        {
            if(S1[j]==0-all[i])
            {
                for(k=j;k<N-2*i-1;k++)
                {
                    ans4++;
                    swap(S1[k],S1[k+1]);

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

        }
    }
    assert(ans1==ans3&&ans2==ans4);
    //printf("%lld %lld %lld %lld\n",ans1,ans2,ans3,ans4);
    return min(min(ans1,ans2),min(ans3,ans4));
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:17:15: warning: unused variable 't' [-Wunused-variable]
     long long t;
               ^

Subtask #1
10.0 / 10.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

Subtask #2
0 / 20.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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -

Subtask #3
0 / 20.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 252 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 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 4 ms 252 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 380 KB Output is correct
18 Runtime error 3 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 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 Runtime error 3 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -

Subtask #6
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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -