제출 #988283

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
988283		kachim2	Arranging Shoes (IOI19_shoes)	C++17	100 / 100	359 ms	149844 KiB

shoes

    #include "shoes.h"
    #include <climits>
#include <stack>
    #include <vector>
    #include <queue>
#include <iostream>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
long long count_swaps(std::vector<int> s) {
      std::vector<int> pos(s.size(), INT_MIN);
      std::vector<int> spos(s.size());
      std::vector<int> rpos(s.size());
      for (int i = 0; i < s.size(); i++) {
        spos[i] = i;
      }
      for (int i = 0; i < s.size(); i++) {
        rpos[i] = i;
      }
      auto qm = new std::queue<int>[100007];
      auto qp = new std::queue<int> [100007];
     
      for (int i = 0; i < s.size(); i++) {
        if (s[i] < 0) {
          if (qp[-s[i]].empty()) {
    	qm[-s[i]].push(i);
          } else {
            auto x = qp[-s[i]].front();
            qp[-s[i]].pop();
    	pos[i] = x;
          }
        } else {
          if (qm[s[i]].empty()) {
    	qp[s[i]].push(i);
          } else {
            auto x = qm[s[i]].front();
            qm[s[i]].pop();
    	pos[i] = x;
          }
        }
      }
      long count = 0;
      // for (auto i : spos) {
      // std::cerr << i << ' ';
      //}
      tree<int, null_type, std::less<int>, rb_tree_tag,
           tree_order_statistics_node_update>
          B;
      for (int i = 0; i < s.size(); i++) {
	B.insert(i*3+1);
      }
      for (int i = 0; i < s.size(); i++) {
        if (pos[i] >= 0) {
          if (s[i] > 0) {
            count +=
                B.order_of_key(i * 3 + 1) - B.order_of_key(pos[i] * 3 + 1) - 1;
            B.erase(i * 3 + 1);
	    B.insert(pos[i]*3+2);
          } else {
	                count +=
                B.order_of_key(i * 3 + 1) - B.order_of_key(pos[i] * 3 + 1);
            B.erase(i * 3 + 1);
	    B.insert(pos[i]*3);
          }
        }
      }
      //    for (auto i : spos) {
	 //    std::cerr << i << ' ';
      //   }
//  std::cerr << '\n';
      //    for (auto i : rpos) {
      //   //      std::cerr << i << ' ';
      //   }
      //   std::cerr << '\n';
      //    for (auto i : pos) {
      //      std::cerr << i << ' ';
      //       }
      delete[] qm;
      delete[] qp;
      return count;
    }

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

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

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