oj.uz

답안 #1003618

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1003618 2024-06-20T13:58:45 Z AdamGS Golf (JOI17_golf) C++17
30 / 100
 10000 ms 30360 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=1e5+7, INF=1e9+7;
pair<pair<int,int>,pair<int,int>>T[LIM];
vector<pair<int,pair<int,int>>>P[2];
int odl[10*LIM][2];
int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  int x1, y1, x2, y2, n;
  cin >> x1 >> y1 >> x2 >> y2 >> n;
  rep(i, n) cin >> T[i].st.st >> T[i].nd.st >> T[i].st.nd >> T[i].nd.nd;
  rep(xd, 2) {
    vector<pair<pair<int,int>,int>>V;
    rep(i, n) {
      if(T[i].st.st<T[i].nd.st && T[i].st.nd<T[i].nd.nd) {
        V.pb({{T[i].nd.nd, 0}, T[i].st.st});
        V.pb({{T[i].nd.nd, 0}, T[i].nd.st-1});
        V.pb({{T[i].st.nd+1, -1}, T[i].st.st});
        V.pb({{T[i].st.nd+1, -1}, T[i].nd.st-1});
      }
      V.pb({{T[i].st.nd, 2}, T[i].st.st});
      V.pb({{T[i].nd.nd, 2}, T[i].st.st});
    }
    V.pb({{y1, 2}, x1});
    V.pb({{y2, 2}, x2});
    sort(all(V));
    set<int>S;
    S.insert(-INF);
    S.insert(INF);
    for(auto i : V) {
      if(i.st.nd==0) S.erase(i.nd);
      else if(i.st.nd==-1) S.insert(i.nd);
      else {
        auto it=S.lower_bound(i.nd);
        auto b=*it;
        --it;
        auto a=*it;
        P[xd].pb({i.st.st, {a+1, b}});
      }
    }
    rep(i, n) {
      swap(T[i].st.st, T[i].st.nd);
      swap(T[i].nd.st, T[i].nd.nd);
    }
    swap(x1, y1);
    swap(x2, y2);
  }
  rep(i, 2) rep(j, P[i].size()) odl[j][i]=INF;
  queue<pair<int,int>>q;
  rep(i, P[0].size()) if(P[0][i].st==y1 && P[0][i].nd.st<=x1 && x1<=P[0][i].nd.nd) {
    odl[i][0]=1;
    q.push({i, 0});
  }
  rep(i, P[1].size()) if(P[1][i].st==x1 && P[1][i].nd.st<=y1 && y1<=P[1][i].nd.nd) {
    odl[i][1]=1;
    q.push({i, 1});
  }
  while(!q.empty()) {
    int a=q.front().st, b=q.front().nd; q.pop();
    rep(i, P[b^1].size()) if(odl[i][b^1]==INF && P[b][a].nd.st<=P[b^1][i].st && P[b^1][i].st<=P[b][a].nd.nd
        && P[b^1][i].nd.st<=P[b][a].st && P[b][a].st<=P[b^1][i].nd.nd) {
      odl[i][b^1]=odl[a][b]+1;
      q.push({i, b^1});
    }
  }
  int ans=INF;
  rep(i, P[0].size()) if(P[0][i].st==y2 && P[0][i].nd.st<=x2 && x2<=P[0][i].nd.nd) ans=min(ans, odl[i][0]);
  rep(i, P[1].size()) if(P[1][i].st==x2 && P[1][i].nd.st<=y2 && y2<=P[1][i].nd.nd) ans=min(ans, odl[i][1]);
  cout << ans << '\n';
}

Compilation message

golf.cpp: In function 'int main()':
golf.cpp:5:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
golf.cpp:55:13: note: in expansion of macro 'rep'
   55 |   rep(i, 2) rep(j, P[i].size()) odl[j][i]=INF;
      |             ^~~
golf.cpp:5:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
golf.cpp:57:3: note: in expansion of macro 'rep'
   57 |   rep(i, P[0].size()) if(P[0][i].st==y1 && P[0][i].nd.st<=x1 && x1<=P[0][i].nd.nd) {
      |   ^~~
golf.cpp:5:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
golf.cpp:61:3: note: in expansion of macro 'rep'
   61 |   rep(i, P[1].size()) if(P[1][i].st==x1 && P[1][i].nd.st<=y1 && y1<=P[1][i].nd.nd) {
      |   ^~~
golf.cpp:5:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
golf.cpp:67:5: note: in expansion of macro 'rep'
   67 |     rep(i, P[b^1].size()) if(odl[i][b^1]==INF && P[b][a].nd.st<=P[b^1][i].st && P[b^1][i].st<=P[b][a].nd.nd
      |     ^~~
golf.cpp:5:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
golf.cpp:74:3: note: in expansion of macro 'rep'
   74 |   rep(i, P[0].size()) if(P[0][i].st==y2 && P[0][i].nd.st<=x2 && x2<=P[0][i].nd.nd) ans=min(ans, odl[i][0]);
      |   ^~~
golf.cpp:5:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
golf.cpp:75:3: note: in expansion of macro 'rep'
   75 |   rep(i, P[1].size()) if(P[1][i].st==x2 && P[1][i].nd.st<=y2 && y2<=P[1][i].nd.nd) ans=min(ans, odl[i][1]);
      |   ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 11 ms 724 KB Output is correct
6 Correct 11 ms 728 KB Output is correct
7 Correct 14 ms 604 KB Output is correct
8 Correct 14 ms 480 KB Output is correct
9 Correct 12 ms 668 KB Output is correct
10 Correct 13 ms 604 KB Output is correct
11 Correct 14 ms 600 KB Output is correct
12 Correct 21 ms 716 KB Output is correct
13 Correct 12 ms 604 KB Output is correct
14 Correct 12 ms 604 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 8 ms 696 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 11 ms 724 KB Output is correct
6 Correct 11 ms 728 KB Output is correct
7 Correct 14 ms 604 KB Output is correct
8 Correct 14 ms 480 KB Output is correct
9 Correct 12 ms 668 KB Output is correct
10 Correct 13 ms 604 KB Output is correct
11 Correct 14 ms 600 KB Output is correct
12 Correct 21 ms 716 KB Output is correct
13 Correct 12 ms 604 KB Output is correct
14 Correct 12 ms 604 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 8 ms 696 KB Output is correct
17 Correct 12 ms 604 KB Output is correct
18 Correct 11 ms 856 KB Output is correct
19 Correct 13 ms 600 KB Output is correct
20 Correct 11 ms 604 KB Output is correct
21 Correct 12 ms 856 KB Output is correct
22 Correct 17 ms 600 KB Output is correct
23 Correct 12 ms 604 KB Output is correct
24 Correct 11 ms 604 KB Output is correct
25 Correct 10 ms 528 KB Output is correct
26 Correct 20 ms 748 KB Output is correct
27 Correct 3 ms 604 KB Output is correct
28 Correct 11 ms 604 KB Output is correct
29 Correct 10 ms 604 KB Output is correct

Subtask #3
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 11 ms 724 KB Output is correct
6 Correct 11 ms 728 KB Output is correct
7 Correct 14 ms 604 KB Output is correct
8 Correct 14 ms 480 KB Output is correct
9 Correct 12 ms 668 KB Output is correct
10 Correct 13 ms 604 KB Output is correct
11 Correct 14 ms 600 KB Output is correct
12 Correct 21 ms 716 KB Output is correct
13 Correct 12 ms 604 KB Output is correct
14 Correct 12 ms 604 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 8 ms 696 KB Output is correct
17 Correct 12 ms 604 KB Output is correct
18 Correct 11 ms 856 KB Output is correct
19 Correct 13 ms 600 KB Output is correct
20 Correct 11 ms 604 KB Output is correct
21 Correct 12 ms 856 KB Output is correct
22 Correct 17 ms 600 KB Output is correct
23 Correct 12 ms 604 KB Output is correct
24 Correct 11 ms 604 KB Output is correct
25 Correct 10 ms 528 KB Output is correct
26 Correct 20 ms 748 KB Output is correct
27 Correct 3 ms 604 KB Output is correct
28 Correct 11 ms 604 KB Output is correct
29 Correct 10 ms 604 KB Output is correct
30 Execution timed out 10020 ms 30360 KB Time limit exceeded
31 Halted 0 ms 0 KB -