제출 #987724

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
987724		wood	자리 배치 (IOI18_seats)	C++17	11 / 100	4081 ms	40876 KiB

seats

#include "seats.h"
#include <bits/stdc++.h>  
using namespace std;
 
typedef long long ll;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define vi vector<int>
#define vp32 vector<p32>
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MOD %1000000007
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//never guess
//never debug without reviewing code
//never try adding ones or substracting them
//only step by step debug when necessay


namespace potato{
    int H,W; vi R,C;
}

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    potato::H = H, potato::W = W, potato::R = R, potato::C = C;
}

int swap_seats(int a, int b) {
    using namespace potato;
    swap(R[a],R[b]); swap(C[a],C[b]);
    int rmin = R[0], rmax  = R[0], cmin = C[0], cmax = C[0];
    int res = 1;
    for (size_t i = 1; i < H*W; i++)
    {
        rmin = min(rmin,R[i]); rmax = max(rmax,R[i]);
        cmin = min(cmin,C[i]); cmax = max(cmax,C[i]);
        if(i+1==(rmax-rmin+1)*(cmax-cmin+1)) res++;
    }
    return res;
}
// int main(int argc, char const *argv[])
// {
//     give_initial_chart(1,1,{0},{0});
//     return 0;
// }

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

seats.cpp: In function 'int swap_seats(int, int)':
seats.cpp:40:26: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   40 |     for (size_t i = 1; i < H*W; i++)
      |                        ~~^~~~~
seats.cpp:44:15: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |         if(i+1==(rmax-rmin+1)*(cmax-cmin+1)) res++;
      |            ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 6 / 6
• Subtask 3: 0 / 20
• Subtask 4: 0 / 6
• Subtask 5: 0 / 33
• Subtask 6: 0 / 30