oj.uz

답안 #278507

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
278507 2020-08-21T13:15:48 Z ctziapo Arranging Shoes (IOI19_shoes) C++14
50 / 100
 151 ms 23928 KB 
#include "shoes.h"
#include <cstdio>
#include <cassert>
#include <iostream>
#include <vector>

using namespace std;

long int seg[600000];

void update(int s,int e,int u,int ind){

   if(u<s || u>e){
    return;
   }

   if(s==e && s==u){
        seg[ind]=1;
        return;
   }

   int mid=(s+e)/2;
   update(s,mid,u,ind*2);
   update(mid+1,e,u,ind*2+1);

   seg[ind]=seg[ind*2]+seg[ind*2+1];
}

int query(int s,int e , int qs,int qe,int ind){

    if(qs<=s && e<=qe){
        return seg[ind];
    }
    if(qs>e || qe<s){
        return 0;
    }

   int mid=(s+e)/2;
   int p1=query(s,mid,qs,qe,ind*2);
   int p2=query(mid+1,e,qs,qe,ind*2+1);

   return p1+p2;

}
long long count_swaps(std::vector<int> s) {

    vector < int > row;
    vector < int > row2;
    vector < vector < int > > l(200000,row);
    vector < vector < int > > r(200000,row2);

    int li[200000+1]={};
    int ri[200000+1]={};

    for(int i=0;i<s.size();i++){
        if(s[i]>0){
            r[s[i]].push_back(i);
        }
        else
            l[-s[i]].push_back(i);
    }

	int ans=0;

	/// n log n
    int v[200000]={};
	for(int i=0;i<s.size();i++){
        long long int cou=0;
        if(v[i]==1){
            continue;
        }

        int f=-s[i];
        if(f>0){
        li[f]++;
        int start=i;
        int e=r[f][ri[f]];
        ri[f]++;
        int q=query(1,s.size(),start+1,e+1,1);

        v[start]=1;
        v[e]=1;

        update(1,s.size(),start+1,1);
        update(1,s.size(),e+1,1);
       // cout<<q<<endl;
        cou=cou + e-start-1-q;
        }
        else{
            cou=1;
             ri[-f]++;
             int start=i;
             int e=l[-f][li[-f]];
             li[-f]++;

            int q=query(1,s.size(),start+1,e+1,1);

             v[start]=1;
        v[e]=1;

        update(1,s.size(),start+1,1);
        update(1,s.size(),e+1,1);
         //   cout<<q<<endl;
             cou=cou + e-start-1-q;
        }
        ans+=cou;
	}

	return ans;


}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:55:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     for(int i=0;i<s.size();i++){
      |                 ~^~~~~~~~~
shoes.cpp:67:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |  for(int i=0;i<s.size();i++){
      |              ~^~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12032 KB Output is correct
2 Correct 8 ms 12032 KB Output is correct
3 Correct 8 ms 12032 KB Output is correct
4 Correct 9 ms 12032 KB Output is correct
5 Correct 8 ms 12032 KB Output is correct
6 Correct 8 ms 12032 KB Output is correct
7 Correct 8 ms 12032 KB Output is correct
8 Correct 9 ms 12032 KB Output is correct
9 Correct 8 ms 12032 KB Output is correct
10 Correct 9 ms 12160 KB Output is correct
11 Correct 8 ms 12032 KB Output is correct
12 Correct 8 ms 12032 KB Output is correct
13 Correct 8 ms 12032 KB Output is correct
14 Correct 8 ms 12032 KB Output is correct
15 Correct 8 ms 12032 KB Output is correct
16 Correct 9 ms 12032 KB Output is correct
17 Correct 8 ms 12032 KB Output is correct
18 Correct 8 ms 12032 KB Output is correct
19 Correct 8 ms 12032 KB Output is correct
20 Correct 8 ms 12032 KB Output is correct
21 Correct 8 ms 12032 KB Output is correct
22 Correct 8 ms 12032 KB Output is correct
23 Correct 8 ms 12032 KB Output is correct
24 Correct 8 ms 12032 KB Output is correct
25 Correct 8 ms 12032 KB Output is correct
26 Correct 8 ms 12032 KB Output is correct
27 Correct 8 ms 12032 KB Output is correct
28 Correct 8 ms 12032 KB Output is correct
29 Correct 8 ms 12032 KB Output is correct
30 Correct 8 ms 12032 KB Output is correct
31 Correct 8 ms 12032 KB Output is correct
32 Correct 8 ms 12160 KB Output is correct
33 Correct 8 ms 12032 KB Output is correct
34 Correct 10 ms 12032 KB Output is correct
35 Correct 10 ms 12032 KB Output is correct
36 Correct 8 ms 12032 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12032 KB Output is correct
2 Correct 8 ms 12032 KB Output is correct
3 Correct 8 ms 12032 KB Output is correct
4 Correct 8 ms 12032 KB Output is correct
5 Correct 9 ms 12032 KB Output is correct
6 Correct 10 ms 12028 KB Output is correct
7 Correct 8 ms 12032 KB Output is correct
8 Correct 8 ms 12032 KB Output is correct
9 Correct 8 ms 12032 KB Output is correct
10 Correct 8 ms 12032 KB Output is correct
11 Correct 8 ms 12032 KB Output is correct
12 Correct 8 ms 12032 KB Output is correct
13 Correct 9 ms 12032 KB Output is correct
14 Correct 8 ms 12032 KB Output is correct
15 Correct 9 ms 12032 KB Output is correct
16 Correct 10 ms 12032 KB Output is correct
17 Correct 8 ms 12032 KB Output is correct
18 Correct 10 ms 12160 KB Output is correct
19 Correct 9 ms 12160 KB Output is correct
20 Correct 17 ms 12928 KB Output is correct
21 Correct 18 ms 12928 KB Output is correct
22 Correct 113 ms 18680 KB Output is correct
23 Correct 102 ms 18668 KB Output is correct
24 Correct 117 ms 18672 KB Output is correct
25 Incorrect 108 ms 18672 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12032 KB Output is correct
2 Correct 9 ms 12032 KB Output is correct
3 Correct 8 ms 12032 KB Output is correct
4 Correct 8 ms 12032 KB Output is correct
5 Incorrect 151 ms 23928 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12032 KB Output is correct
2 Correct 8 ms 12032 KB Output is correct
3 Correct 8 ms 12032 KB Output is correct
4 Correct 9 ms 12032 KB Output is correct
5 Correct 8 ms 12032 KB Output is correct
6 Correct 8 ms 12032 KB Output is correct
7 Correct 8 ms 12032 KB Output is correct
8 Correct 9 ms 12032 KB Output is correct
9 Correct 8 ms 12032 KB Output is correct
10 Correct 9 ms 12160 KB Output is correct
11 Correct 8 ms 12032 KB Output is correct
12 Correct 8 ms 12032 KB Output is correct
13 Correct 8 ms 12032 KB Output is correct
14 Correct 8 ms 12032 KB Output is correct
15 Correct 8 ms 12032 KB Output is correct
16 Correct 9 ms 12032 KB Output is correct
17 Correct 8 ms 12032 KB Output is correct
18 Correct 8 ms 12032 KB Output is correct
19 Correct 8 ms 12032 KB Output is correct
20 Correct 8 ms 12032 KB Output is correct
21 Correct 8 ms 12032 KB Output is correct
22 Correct 8 ms 12032 KB Output is correct
23 Correct 8 ms 12032 KB Output is correct
24 Correct 8 ms 12032 KB Output is correct
25 Correct 8 ms 12032 KB Output is correct
26 Correct 8 ms 12032 KB Output is correct
27 Correct 8 ms 12032 KB Output is correct
28 Correct 8 ms 12032 KB Output is correct
29 Correct 8 ms 12032 KB Output is correct
30 Correct 8 ms 12032 KB Output is correct
31 Correct 8 ms 12032 KB Output is correct
32 Correct 8 ms 12160 KB Output is correct
33 Correct 8 ms 12032 KB Output is correct
34 Correct 10 ms 12032 KB Output is correct
35 Correct 10 ms 12032 KB Output is correct
36 Correct 8 ms 12032 KB Output is correct
37 Correct 8 ms 12032 KB Output is correct
38 Correct 8 ms 12032 KB Output is correct
39 Correct 8 ms 12032 KB Output is correct
40 Correct 8 ms 12032 KB Output is correct
41 Correct 11 ms 12160 KB Output is correct
42 Correct 9 ms 12288 KB Output is correct
43 Correct 9 ms 12288 KB Output is correct
44 Correct 9 ms 12160 KB Output is correct
45 Correct 9 ms 12160 KB Output is correct
46 Correct 9 ms 12160 KB Output is correct
47 Correct 9 ms 12160 KB Output is correct
48 Correct 9 ms 12160 KB Output is correct
49 Correct 9 ms 12160 KB Output is correct
50 Correct 9 ms 12160 KB Output is correct
51 Correct 9 ms 12160 KB Output is correct
52 Correct 9 ms 12160 KB Output is correct

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12032 KB Output is correct
2 Correct 8 ms 12032 KB Output is correct
3 Correct 8 ms 12032 KB Output is correct
4 Correct 9 ms 12032 KB Output is correct
5 Correct 8 ms 12032 KB Output is correct
6 Correct 8 ms 12032 KB Output is correct
7 Correct 8 ms 12032 KB Output is correct
8 Correct 9 ms 12032 KB Output is correct
9 Correct 8 ms 12032 KB Output is correct
10 Correct 9 ms 12160 KB Output is correct
11 Correct 8 ms 12032 KB Output is correct
12 Correct 8 ms 12032 KB Output is correct
13 Correct 8 ms 12032 KB Output is correct
14 Correct 8 ms 12032 KB Output is correct
15 Correct 8 ms 12032 KB Output is correct
16 Correct 9 ms 12032 KB Output is correct
17 Correct 8 ms 12032 KB Output is correct
18 Correct 8 ms 12032 KB Output is correct
19 Correct 8 ms 12032 KB Output is correct
20 Correct 8 ms 12032 KB Output is correct
21 Correct 8 ms 12032 KB Output is correct
22 Correct 8 ms 12032 KB Output is correct
23 Correct 8 ms 12032 KB Output is correct
24 Correct 8 ms 12032 KB Output is correct
25 Correct 8 ms 12032 KB Output is correct
26 Correct 8 ms 12032 KB Output is correct
27 Correct 8 ms 12032 KB Output is correct
28 Correct 8 ms 12032 KB Output is correct
29 Correct 8 ms 12032 KB Output is correct
30 Correct 8 ms 12032 KB Output is correct
31 Correct 8 ms 12032 KB Output is correct
32 Correct 8 ms 12160 KB Output is correct
33 Correct 8 ms 12032 KB Output is correct
34 Correct 10 ms 12032 KB Output is correct
35 Correct 10 ms 12032 KB Output is correct
36 Correct 8 ms 12032 KB Output is correct
37 Correct 8 ms 12032 KB Output is correct
38 Correct 8 ms 12032 KB Output is correct
39 Correct 9 ms 12032 KB Output is correct
40 Correct 10 ms 12028 KB Output is correct
41 Correct 8 ms 12032 KB Output is correct
42 Correct 8 ms 12032 KB Output is correct
43 Correct 8 ms 12032 KB Output is correct
44 Correct 8 ms 12032 KB Output is correct
45 Correct 8 ms 12032 KB Output is correct
46 Correct 8 ms 12032 KB Output is correct
47 Correct 9 ms 12032 KB Output is correct
48 Correct 8 ms 12032 KB Output is correct
49 Correct 9 ms 12032 KB Output is correct
50 Correct 10 ms 12032 KB Output is correct
51 Correct 8 ms 12032 KB Output is correct
52 Correct 10 ms 12160 KB Output is correct
53 Correct 9 ms 12160 KB Output is correct
54 Correct 17 ms 12928 KB Output is correct
55 Correct 18 ms 12928 KB Output is correct
56 Correct 113 ms 18680 KB Output is correct
57 Correct 102 ms 18668 KB Output is correct
58 Correct 117 ms 18672 KB Output is correct
59 Incorrect 108 ms 18672 KB Output isn't correct
60 Halted 0 ms 0 KB -