oj.uz

Submission #143422

# Submission time Handle Problem Language Result Execution time Memory
143422 2019-08-14T01:10:39 Z daniel920712 Arranging Shoes (IOI19_shoes) C++14
10 / 100
 34 ms 3592 KB 
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <assert.h>

using namespace std;
int S1[1005];
int S2[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,x,y;
    long long t;
    now=0;
    for(i=0;i<N/2;i++)
    {
        x=y=0;
        for(j=0;j<N;j++) S1[j]=S[j];
        for(j=0;j<N;j++) S2[j]=S[j];
        for(j=2*i;j<N;j++)
        {
            if(S1[j]<0)
            {
                t=0-S1[j];
                for(k=j;k>2*i;k--)
                {
                    x++;
                    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--)
                {
                    x++;
                    swap(S1[k],S1[k-1]);
                }
                break;
            }

        }

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

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

        }
        if(x<=y)
        {
            ans1+=x;
            for(j=0;j<N;j++) S[j]=S1[j];
        }
        else
        {
            ans1+=y;
            for(j=0;j<N;j++) S[j]=S2[j];
        }
    }


    return ans1;
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:17:22: warning: unused variable 'ans2' [-Wunused-variable]
     long long ans1=0,ans2=0,ans3=0,ans4=0,N=S.size(),i,j,k,now=0,x,y;
                      ^~~~
shoes.cpp:17:29: warning: unused variable 'ans3' [-Wunused-variable]
     long long ans1=0,ans2=0,ans3=0,ans4=0,N=S.size(),i,j,k,now=0,x,y;
                             ^~~~
shoes.cpp:17:36: warning: unused variable 'ans4' [-Wunused-variable]
     long long ans1=0,ans2=0,ans3=0,ans4=0,N=S.size(),i,j,k,now=0,x,y;
                                    ^~~~
shoes.cpp:17:60: warning: variable 'now' set but not used [-Wunused-but-set-variable]
     long long ans1=0,ans2=0,ans3=0,ans4=0,N=S.size(),i,j,k,now=0,x,y;
                                                            ^~~
shoes.cpp:76:24: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if(S2[j]==0-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 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 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 256 KB Output is correct
11 Correct 2 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 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 380 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 0 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Incorrect 2 ms 376 KB Output isn't correct
34 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 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 252 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Runtime error 6 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 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Runtime error 34 ms 3592 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 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 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 256 KB Output is correct
11 Correct 2 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 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 380 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 0 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Incorrect 2 ms 376 KB Output isn't correct
34 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 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 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 256 KB Output is correct
11 Correct 2 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 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 380 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 0 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Incorrect 2 ms 376 KB Output isn't correct
34 Halted 0 ms 0 KB -