oj.uz

답안 #927735

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927735 2024-02-15T09:34:21 Z MrDeboo 자리 배치 (IOI18_seats) C++17
0 / 100
 4000 ms 262144 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;
vector<pair<int,int>>v;
bool hehe=0;
map<int,ordered_set>a,b;
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    if(H==1)hehe=1;
    v.resize(H*W);
    for(int i=0;i<H*W;i++){
        v[i]={R[i],C[i]};
        if(i)a[C[i]+i].insert(C[i]);
        if(i)b[C[i]-i].insert(C[i]);
    }
}
void rmv(int in){
    if(in==0)return;
    a[v[in].second+in].erase(v[in].second);
    b[v[in].second-in].erase(v[in].second);
}
void ad(int in){
    if(in==0)return;
    a[v[in].second+in].insert(v[in].second);
    b[v[in].second-in].insert(v[in].second);
}
int clc(){
    int g=v[0].second;
    int ans=0;
    ans+=a[g].order_of_key(g);
    ans+=b[g].size()-b[g].order_of_key(g);
    return ans;
}
int swap_seats(int a, int b){
    if(hehe){
        rmv(a);
        rmv(b);
        swap(v[a],v[b]);
        ad(a);
        ad(b);
        return clc();
    }
    int ans=0;
    swap(v[a],v[b]);
    pair<pair<int,int>,pair<int,int>>pr={{v[0].first,v[0].first},{v[0].second,v[0].second}};
    for(int i=0;i<v.size();i++){
        pr.first.first=min(pr.first.first,v[i].first);
        pr.first.second=max(pr.first.second,v[i].first);
        pr.second.first=min(pr.second.first,v[i].second);
        pr.second.second=max(pr.second.second,v[i].second);
        if(i+1==(pr.second.second-pr.second.first+1)*(pr.first.second-pr.first.first+1))ans++;
    }
    return ans;
}

Compilation message

seats.cpp: In function 'int swap_seats(int, int)':
seats.cpp:48:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Incorrect 5 ms 604 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Incorrect 5 ms 604 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 619 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 3064 KB Output is correct
2 Correct 1105 ms 24688 KB Output is correct
3 Execution timed out 4045 ms 256984 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 1472 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Incorrect 5 ms 604 KB Output isn't correct
5 Halted 0 ms 0 KB -