oj.uz

답안 #143851

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
143851 2019-08-15T10:40:28 Z daniel920712 Arranging Shoes (IOI19_shoes) C++14
30 / 100
 34 ms 3576 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];
int a[1005]={0};
int b[1005]={0};
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(),now=0,x,y,small,what;
    long long t;
    int i,j,k;
    now=0;
    for(i=0;i<N/2;i++)
    {
        for(j=1;j<=N/2;j++)
        {
            a[j]=100000000;
            b[j]=100000000;
        }
        for(j=2*i;j<N;j++)
        {
            if(S[j]<0) b[0-S[j]]=min(b[0-S[j]],j);
            else a[S[j]]=min(a[S[j]],j);
        }
        small=1000000000;
        for(j=1;j<=N/2;j++)
        {
            if(a[j]+b[j]<=small)
            {
                small=a[j]+b[j];
                if(a[j]>b[j]) small++;
                what=j;
            }
        }
        //printf("%lld\n",what);
        for(j=2*i;j<N;j++)
        {
            if(S[j]==0-what)
            {
                for(k=j;k>2*i;k--)
                {
                    swap(S[k],S[k-1]);
                    ans1++;
                }
                break;
            }
        }
        for(j=2*i+1;j<N;j++)
        {
            if(S[j]==what)
            {
                for(k=j;k>2*i+1;k--)
                {
                    swap(S[k],S[k-1]);
                    ans1++;
                }
                break;
            }
        }
    }


    return ans1;
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:19:22: warning: unused variable 'ans2' [-Wunused-variable]
     long long ans1=0,ans2=0,ans3=0,ans4=0,N=S.size(),now=0,x,y,small,what;
                      ^~~~
shoes.cpp:19:29: warning: unused variable 'ans3' [-Wunused-variable]
     long long ans1=0,ans2=0,ans3=0,ans4=0,N=S.size(),now=0,x,y,small,what;
                             ^~~~
shoes.cpp:19:36: warning: unused variable 'ans4' [-Wunused-variable]
     long long ans1=0,ans2=0,ans3=0,ans4=0,N=S.size(),now=0,x,y,small,what;
                                    ^~~~
shoes.cpp:19:54: warning: variable 'now' set but not used [-Wunused-but-set-variable]
     long long ans1=0,ans2=0,ans3=0,ans4=0,N=S.size(),now=0,x,y,small,what;
                                                      ^~~
shoes.cpp:19:60: warning: unused variable 'x' [-Wunused-variable]
     long long ans1=0,ans2=0,ans3=0,ans4=0,N=S.size(),now=0,x,y,small,what;
                                                            ^
shoes.cpp:19:62: warning: unused variable 'y' [-Wunused-variable]
     long long ans1=0,ans2=0,ans3=0,ans4=0,N=S.size(),now=0,x,y,small,what;
                                                              ^
shoes.cpp:20:15: warning: unused variable 't' [-Wunused-variable]
     long long t;
               ^
shoes.cpp:48:23: warning: 'what' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if(S[j]==0-what)
                      ~^~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 348 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 256 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 256 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 268 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 252 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 2 ms 252 KB Output is correct
31 Correct 3 ms 368 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 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 380 KB Output is correct
6 Correct 2 ms 312 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 376 KB Output is correct
10 Correct 2 ms 380 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 252 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 3 ms 256 KB Output is correct
17 Correct 3 ms 256 KB Output is correct
18 Correct 9 ms 376 KB Output is correct
19 Correct 9 ms 376 KB Output is correct
20 Runtime error 5 ms 808 KB Execution killed with signal 11 (could be triggered by violating memory limits)
21 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Runtime error 34 ms 3576 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 348 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 256 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 256 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 268 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 252 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 2 ms 252 KB Output is correct
31 Correct 3 ms 368 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 252 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 256 KB Output is correct
40 Incorrect 3 ms 376 KB Output isn't correct
41 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 348 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 256 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 256 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 268 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 252 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 2 ms 252 KB Output is correct
31 Correct 3 ms 368 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 256 KB Output is correct
38 Correct 2 ms 256 KB Output is correct
39 Correct 2 ms 380 KB Output is correct
40 Correct 2 ms 312 KB Output is correct
41 Correct 2 ms 256 KB Output is correct
42 Correct 2 ms 256 KB Output is correct
43 Correct 2 ms 376 KB Output is correct
44 Correct 2 ms 380 KB Output is correct
45 Correct 2 ms 256 KB Output is correct
46 Correct 2 ms 256 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 2 ms 252 KB Output is correct
49 Correct 2 ms 256 KB Output is correct
50 Correct 3 ms 256 KB Output is correct
51 Correct 3 ms 256 KB Output is correct
52 Correct 9 ms 376 KB Output is correct
53 Correct 9 ms 376 KB Output is correct
54 Runtime error 5 ms 808 KB Execution killed with signal 11 (could be triggered by violating memory limits)
55 Halted 0 ms 0 KB -