oj.uz

Submission #143250

# Submission time Handle Problem Language Result Execution time Memory
143250 2019-08-13T12:22:24 Z daniel920712 Arranging Shoes (IOI19_shoes) C++14
10 / 100
 34 ms 3720 KB 
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <assert.h>

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

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

            }
        }
        for(j=2*i;j<N;j++)
        {
            if(S1[j]==t)
            {
                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-t)
            {
                for(k=j;k>2*i+1;k--)
                {
                    ans2++;
                    swap(S1[k],S1[k-1]);
                }
                break;
            }
        }


    }
    return min(ans1,ans2);
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:15:49: warning: unused variable 'now' [-Wunused-variable]
     long long ans1=0,ans2=1e18,N=S.size(),i,j,k,now=0;
                                                 ^~~
shoes.cpp:74:24: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if(S1[j]==0-t)
                       ~^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 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 3 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 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 3 ms 376 KB Output is correct
3 Correct 2 ms 256 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 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Incorrect 2 ms 256 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 34 ms 3720 KB Execution killed with signal 11 (could be triggered by violating memory limits)
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 3 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 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 3 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -