oj.uz

답안 #999943

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
999943 2024-06-16T10:48:03 Z AdamGS Cultivation (JOI17_cultivation) C++17
65 / 100
 2000 ms 2940 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#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 ll INF=2e9+7;
const int LIM=307;
pair<ll,ll>T[LIM];
ll tmi[LIM][LIM], tma[LIM][LIM], R, C, n, akt1, akt2, akt3;
vector<pair<ll,ll>>Ci, Di, Ei;
ll solveab(ll a, ll b) {
  ll c=0, d=0, cpd=0;
  while(akt1>0 && Ci[akt1-1].st<=b) --akt1;
  c=Ci[akt1].nd;
  while(akt2>0 && Di[akt2-1].st<=b) --akt2;
  d=Di[akt2].nd;
  while(akt3<Ei.size() && Ei[akt3].st<b) ++akt3;
  if(Ei.size()>0 && Ei[akt3].st>=b) cpd=max(Ei[akt3].nd, 0ll);
  return a+b+max(c+d, cpd);
}
ll solvea(ll a) {
  Ci.clear(); Di.clear(); Ei.clear();
  vector<pair<ll,ll>>P;
  rep(i, n) P.pb({T[i].nd, i});
  sort(all(P));
  vector<pair<ll,ll>>Q;
  rep(i, n) {
    Q.pb({max(1ll, T[P[i].nd].st-a), T[P[i].nd].st});
    for(int j=(int)Q.size()-1; j>0; --j) if(Q[j]<Q[j-1]) swap(Q[j], Q[j-1]);
    ll ma=1, mi=0;
    for(auto j : Q) {
      mi=max(mi, j.st-ma-1);
      ma=max(ma, j.nd);
    }
    mi=max(mi, R-ma);
    if(Q[0].st!=1) mi=INF;
    Ci.pb({mi, P[i].st-1});
  }
  Q.clear();
  rep(i, n) {
    Q.pb({max(1ll, T[P[n-i-1].nd].st-a), T[P[n-i-1].nd].st});
    for(int j=(int)Q.size()-1; j>0; --j) if(Q[j]<Q[j-1]) swap(Q[j], Q[j-1]);
    ll ma=1, mi=0;
    for(auto j : Q) {
      mi=max(mi, j.st-ma-1);
      ma=max(ma, j.nd);
    }
    mi=max(mi, R-ma);
    if(Q[0].st!=1) mi=INF;
    Di.pb({mi, C-P[n-i-1].st});
  }
  ll einf=-1;
  rep(xd, 2) {
    rep(i, n) rep(j, n) {
      tmi[i][j]=R+1;
      tma[i][j]=0;
    }
    rep(i, n) {
      for(int j=i+1; j<n; ++j) {
        tmi[i][j]=tmi[i][j-1];
        if(T[P[j].nd].st>=T[P[i].nd].st) tmi[i][j]=min(tmi[i][j], T[P[j].nd].st-a);
      }
    }
    rep(i, n) {
      for(int j=i-1; j>=0; --j) {
        tma[j][i]=tma[j+1][i];
        if(T[P[j].nd].st<=T[P[i].nd].st) tma[j][i]=max(tma[j][i], T[P[j].nd].st);
      }
    }
    rep(j, n) rep(i, j) {
      if(T[P[i].nd].st<=T[P[j].nd].st) {
        if(tmi[i][j-1]<=0) continue;
        else if(tmi[i][j-1]==10*INF || tma[i+1][j]==0) einf=max(einf, abs(P[i].st-P[j].st)-1);
        //Ei.pb({10*INF, abs(P[i].st-P[j].st)-1});
        else if(tmi[i][j-1]-tma[i+1][j]-2>=0) Ei.pb({tmi[i][j-1]-tma[i+1][j]-2, abs(P[i].st-P[j].st)-1});
      }
    }
    reverse(all(P));
  }
  Ei.pb({10*INF, einf});
  sort(all(Ei));
  for(int i=(int)Ei.size()-2; i>=0; --i) Ei[i].nd=max(Ei[i].nd, Ei[i+1].nd);
  vector<ll>A;
  rep(i, n) A.pb(T[i].st);
  sort(all(A));
  ll b=R-A[n-1], apb=0;
  rep(i, n-1) apb=max(apb, A[i+1]-A[i]-1);
  ll ans=INF;
  vector<ll>kol;
  rep(i, n) {
    ll x=R-T[i].st;
    if(x>=b && a+x>=apb) kol.pb(x);
  }
  rep(i, n) rep(j, i) {
    ll x=abs(T[i].st-T[j].st)-1;
    if(x==-1 || x<apb) continue;
    ll y=x-a;
    if(y>=b) kol.pb(y);
  }
  sort(all(kol));
  akt1=Ci.size();
  akt2=Di.size();
  akt3=0;
  ll lst=-INF;
  for(auto i : kol) if(i!=lst) {
    ans=min(ans, solveab(a, i));
    lst=i;
  }
  return ans;
}
ll solve() {
  ll ans=INF;
  rep(i, n) ans=min(ans, solvea(T[i].st-1));
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  cin >> R >> C >> n;
  rep(i, n) cin >> T[i].st >> T[i].nd;
  ll ans=INF;
  rep(i, 4) {
    ans=min(ans, solve());
    rep(j, n) T[j]={C-T[j].nd+1, T[j].st};
    swap(R, C);
  }
  cout << ans << '\n';
}

Compilation message

cultivation.cpp: In function 'll solveab(ll, ll)':
cultivation.cpp:23:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |   while(akt3<Ei.size() && Ei[akt3].st<b) ++akt3;
      |         ~~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 21 ms 600 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 8 ms 604 KB Output is correct
22 Correct 130 ms 1116 KB Output is correct
23 Correct 3 ms 600 KB Output is correct
24 Correct 595 ms 1852 KB Output is correct
25 Correct 255 ms 1652 KB Output is correct
26 Correct 1725 ms 2812 KB Output is correct
27 Correct 1889 ms 2824 KB Output is correct
28 Correct 579 ms 1848 KB Output is correct
29 Correct 1765 ms 2840 KB Output is correct
30 Correct 1854 ms 2824 KB Output is correct
31 Correct 1805 ms 2820 KB Output is correct
32 Correct 1824 ms 2824 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 21 ms 600 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 8 ms 604 KB Output is correct
22 Correct 130 ms 1116 KB Output is correct
23 Correct 3 ms 600 KB Output is correct
24 Correct 595 ms 1852 KB Output is correct
25 Correct 255 ms 1652 KB Output is correct
26 Correct 1725 ms 2812 KB Output is correct
27 Correct 1889 ms 2824 KB Output is correct
28 Correct 579 ms 1848 KB Output is correct
29 Correct 1765 ms 2840 KB Output is correct
30 Correct 1854 ms 2824 KB Output is correct
31 Correct 1805 ms 2820 KB Output is correct
32 Correct 1824 ms 2824 KB Output is correct
33 Correct 1756 ms 2940 KB Output is correct
34 Correct 1829 ms 2880 KB Output is correct
35 Execution timed out 2037 ms 2872 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 2 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 2 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 85 ms 1044 KB Output is correct
22 Correct 91 ms 856 KB Output is correct
23 Correct 56 ms 860 KB Output is correct
24 Correct 43 ms 860 KB Output is correct
25 Correct 85 ms 856 KB Output is correct
26 Correct 90 ms 856 KB Output is correct
27 Correct 77 ms 1044 KB Output is correct
28 Correct 89 ms 1048 KB Output is correct
29 Correct 80 ms 860 KB Output is correct
30 Correct 90 ms 860 KB Output is correct
31 Correct 92 ms 860 KB Output is correct
32 Correct 93 ms 1048 KB Output is correct
33 Correct 51 ms 872 KB Output is correct
34 Correct 63 ms 860 KB Output is correct
35 Correct 59 ms 860 KB Output is correct
36 Correct 63 ms 860 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 21 ms 600 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 8 ms 604 KB Output is correct
22 Correct 130 ms 1116 KB Output is correct
23 Correct 3 ms 600 KB Output is correct
24 Correct 595 ms 1852 KB Output is correct
25 Correct 255 ms 1652 KB Output is correct
26 Correct 1725 ms 2812 KB Output is correct
27 Correct 1889 ms 2824 KB Output is correct
28 Correct 579 ms 1848 KB Output is correct
29 Correct 1765 ms 2840 KB Output is correct
30 Correct 1854 ms 2824 KB Output is correct
31 Correct 1805 ms 2820 KB Output is correct
32 Correct 1824 ms 2824 KB Output is correct
33 Correct 1756 ms 2940 KB Output is correct
34 Correct 1829 ms 2880 KB Output is correct
35 Execution timed out 2037 ms 2872 KB Time limit exceeded
36 Halted 0 ms 0 KB -