제출 #989776

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
989776		mindiyak	Arranging Shoes (IOI19_shoes)	C++14	0 / 100	504 ms	1048576 KiB

shoes

#include "shoes.h"

#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fst first
#define nl endl
#define sec second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
using namespace std;

vector<queue<pi>> leftS(1e6);
vector<queue<pi>> rightS(1e6);

long long count_swaps(vector<int> s) {
	ll ans = 0;
	ll swaps = 0;

	FOR(i,0,s.size()){
		// cout << s[i] << " ";
		if(s[i]<0){
			// cout << rightS[abs(s[i])].empty() << " ";
			if(rightS[abs(s[i])].empty()){
				leftS[abs(s[i])].push({i,swaps});
				// cout << i << " " << swaps << endl;
				swaps++;
			}else{
				auto a=rightS[abs(s[i])].front();rightS[abs(s[i])].pop();
				swaps--;
				// cout << i << " " << a.fst << " " << swaps << " " << a.sec << endl;
				ans += i - a.fst - (swaps-a.sec);
			}
		}else{
			// cout << leftS[abs(s[i])].empty() << " ";
			if(leftS[abs(s[i])].empty()){
				// cout << i << " " << swaps << endl;
				rightS[abs(s[i])].push({i,swaps});
				swaps++;
			}else{
				auto a=leftS[abs(s[i])].front();leftS[abs(s[i])].pop();
				swaps--;
				// cout << i << " " << a.fst << " " << swaps << " " << a.sec << endl;
				ans += i - a.fst - (swaps-a.sec) - 1;
			}
		}
		// cout << "ans - " << ans << endl;
	}

	return ans;
}

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

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:23:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 | #define FOR(i, a, b) for (int i = a; i < (b); i++)
      |                                        ^
shoes.cpp:50:2: note: in expansion of macro 'FOR'
   50 |  FOR(i,0,s.size()){
      |  ^~~

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