oj.uz

답안 #927697

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927697 2024-02-15T08:49:47 Z MrDeboo 자리 배치 (IOI18_seats) C++17
5 / 100
 4000 ms 39852 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]);
    for(int i=0;i<v.size();i++)ans+=slv(i);
    return ans;
}

Compilation message

seats.cpp: In function 'int swap_seats(int, int)':
seats.cpp:24: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]
   24 |     for(int i=0;i<v.size();i++)ans+=slv(i);
      |                 ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 604 KB Output is correct
2 Correct 10 ms 604 KB Output is correct
3 Correct 39 ms 604 KB Output is correct
4 Correct 39 ms 768 KB Output is correct
5 Correct 39 ms 564 KB Output is correct
6 Correct 42 ms 596 KB Output is correct
7 Correct 38 ms 360 KB Output is correct
8 Correct 36 ms 564 KB Output is correct
9 Correct 41 ms 600 KB Output is correct
10 Correct 38 ms 348 KB Output is correct
11 Correct 40 ms 552 KB Output is correct
12 Correct 39 ms 348 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 604 KB Output is correct
2 Correct 10 ms 604 KB Output is correct
3 Correct 39 ms 604 KB Output is correct
4 Correct 39 ms 768 KB Output is correct
5 Correct 39 ms 564 KB Output is correct
6 Correct 42 ms 596 KB Output is correct
7 Correct 38 ms 360 KB Output is correct
8 Correct 36 ms 564 KB Output is correct
9 Correct 41 ms 600 KB Output is correct
10 Correct 38 ms 348 KB Output is correct
11 Correct 40 ms 552 KB Output is correct
12 Correct 39 ms 348 KB Output is correct
13 Execution timed out 4074 ms 856 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 6.0

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

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 2004 KB Output is correct
2 Correct 16 ms 2080 KB Output is correct
3 Correct 389 ms 2036 KB Output is correct
4 Execution timed out 4032 ms 1816 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 604 KB Output is correct
2 Correct 10 ms 604 KB Output is correct
3 Correct 39 ms 604 KB Output is correct
4 Correct 39 ms 768 KB Output is correct
5 Correct 39 ms 564 KB Output is correct
6 Correct 42 ms 596 KB Output is correct
7 Correct 38 ms 360 KB Output is correct
8 Correct 36 ms 564 KB Output is correct
9 Correct 41 ms 600 KB Output is correct
10 Correct 38 ms 348 KB Output is correct
11 Correct 40 ms 552 KB Output is correct
12 Correct 39 ms 348 KB Output is correct
13 Execution timed out 4074 ms 856 KB Time limit exceeded
14 Halted 0 ms 0 KB -