제출 #145523

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
145523		AKaan37	Arranging Shoes (IOI19_shoes)	C++17	0 / 100	92 ms	47988 KiB

shoes

#include <bits/stdc++.h>
#include "shoes.h"

using namespace std;

typedef long long lo;
typedef pair< int,int > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int a[li];
vector<int> vv;
vector<int> sag[li];
vector<int> sol[li];

long long count_swaps(vector<int> v) {
	//~ cout<<"**\n";
	
	int cev=0;
	for(int i=0;i<(int)v.size();i++){
		
		if(v[i]<0){
			if((int)sag[v[i]].size()>0){cev+=i-sag[v[i]][0];sag[v[i]].erase(sag[v[i]].begin());}
			else sol[v[i]].pb(i);
		}
		else{
			if((int)sol[v[i]].size()>0){cev+=i-sol[i][0];sol[v[i]].erase(sol[v[i]].begin());}
			else sag[v[i]].pb(i);
		}
		
	}
	return cev;
}

//~ int main(){
	//~ int n=0;
	//~ scanf("%d",&n);
	//~ FOR{
		
		//~ scanf("%d",&a[i]);
		//~ ////~ if(a[i]<0)
		//~ vv.pb(a[i]);
	//~ }
	//~ ////~ cout<<vv[0]<<endl;
	//~ lo at=count_swaps(vv);
	//~ printf("%lld\n",at);
//~ }

컴파일 시 표준 에러 (stderr) 메시지

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:38:26: warning: array subscript is below array bounds [-Warray-bounds]
    if((int)sag[v[i]].size()>0){cev+=i-sag[v[i]][0];sag[v[i]].erase(sag[v[i]].begin());}
            ~~~~~~~~~~~~~~^~
shoes.cpp:39:21: warning: array subscript is below array bounds [-Warray-bounds]
    else sol[v[i]].pb(i);
         ~~~~~~~~~~~~^~~
shoes.cpp:39:17: warning: array subscript is below array bounds [-Warray-bounds]
    else sol[v[i]].pb(i);
         ~~~~~~~~^
shoes.cpp:39:17: warning: array subscript is below array bounds [-Warray-bounds]
shoes.cpp:39:17: warning: array subscript is below array bounds [-Warray-bounds]

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15