oj.uz

답안 #927700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927700 2024-02-15T08:51:39 Z MrDeboo 자리 배치 (IOI18_seats) C++17
11 / 100
 4000 ms 40892 KB 
#include "seats.h"
#include "bits/stdc++.h"
using namespace std;
vector<pair<int,int>>v;
int slv(int in){
    pair<pair<int,int>,pair<int,int>>pr={{v[in].first,v[in].first},{v[in].second,v[in].second}};
    for(int i=in;i>=0;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);
    }
    return (in+1==(pr.second.second-pr.second.first+1)*(pr.first.second-pr.first.first+1));
}
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    v.resize(H*W);
    for(int i=0;i<H*W;i++){
        v[i]={R[i],C[i]};
    }
}
int swap_seats(int a, int b){
    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:25: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]
   25 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 116 ms 680 KB Output is correct
14 Correct 108 ms 860 KB Output is correct
15 Correct 108 ms 856 KB Output is correct
16 Correct 108 ms 864 KB Output is correct
17 Correct 120 ms 1104 KB Output is correct
18 Correct 127 ms 856 KB Output is correct
19 Correct 111 ms 880 KB Output is correct
20 Correct 114 ms 864 KB Output is correct
21 Correct 125 ms 868 KB Output is correct
22 Correct 111 ms 856 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4035 ms 23892 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 604 KB Output is correct
2 Correct 1049 ms 3744 KB Output is correct
3 Execution timed out 4021 ms 39752 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1492 KB Output is correct
2 Correct 12 ms 1496 KB Output is correct
3 Correct 22 ms 1372 KB Output is correct
4 Correct 117 ms 1404 KB Output is correct
5 Correct 1092 ms 2348 KB Output is correct
6 Execution timed out 4017 ms 40892 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 116 ms 680 KB Output is correct
14 Correct 108 ms 860 KB Output is correct
15 Correct 108 ms 856 KB Output is correct
16 Correct 108 ms 864 KB Output is correct
17 Correct 120 ms 1104 KB Output is correct
18 Correct 127 ms 856 KB Output is correct
19 Correct 111 ms 880 KB Output is correct
20 Correct 114 ms 864 KB Output is correct
21 Correct 125 ms 868 KB Output is correct
22 Correct 111 ms 856 KB Output is correct
23 Execution timed out 4035 ms 23892 KB Time limit exceeded
24 Halted 0 ms 0 KB -