oj.uz

Submission #143087

# Submission time Handle Problem Language Result Execution time Memory
143087 2019-08-13T01:11:01 Z daniel920712 Arranging Shoes (IOI19_shoes) C++14
15 / 100
 31 ms 2012 KB 
#include <iostream>
#include <stdio.h>
#include <vector>

using namespace std;
long long count_swaps(std::vector<int> S)
{
    long long ans=0,N=S.size(),i,j,k;
    int t;
    /*for(i=0;i<N/2;i++)
    {
        for(j=2*i;j<N;j++)
        {
            if(S[j]<0)
            {
                ans+=(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)
            {
                ans+=(j-2*i-1);
                t=0-S[j];
                for(k=j;k>2*i+1;k--) swap(S[k],S[k-1]);
                break;
            }
        }

    }*/
    ans=(N/2)*(N/2-1)/2;
    return ans;
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:8:32: warning: unused variable 'i' [-Wunused-variable]
     long long ans=0,N=S.size(),i,j,k;
                                ^
shoes.cpp:8:34: warning: unused variable 'j' [-Wunused-variable]
     long long ans=0,N=S.size(),i,j,k;
                                  ^
shoes.cpp:8:36: warning: unused variable 'k' [-Wunused-variable]
     long long ans=0,N=S.size(),i,j,k;
                                    ^
shoes.cpp:9:9: warning: unused variable 't' [-Wunused-variable]
     int t;
         ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Incorrect 2 ms 256 KB Output isn't correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Incorrect 2 ms 256 KB Output isn't correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Incorrect 2 ms 256 KB Output isn't correct

Subtask #4
15.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 Correct 31 ms 1932 KB Output is correct
6 Correct 31 ms 1912 KB Output is correct
7 Correct 31 ms 1912 KB Output is correct
8 Correct 30 ms 2012 KB Output is correct
9 Correct 31 ms 1912 KB Output is correct
10 Correct 31 ms 1912 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Incorrect 2 ms 256 KB Output isn't correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Incorrect 2 ms 256 KB Output isn't correct