oj.uz

답안 #1033525

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1033525 2024-07-25T02:35:43 Z modwwe The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 1233 ms 54916 KB 
//https://www.instagram.com/_modwwe/
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2")
#include<bits/stdc++.h>
//#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void phongbeo();
const int inf=1e18;
const int mod2=1e9+7;
const int  mod1=998244353;
struct icd
{
    int a,b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c,d,e,f;

};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l;
int  i,s10,s12;
int kk;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
///fin(task),fou(task);
#endif
    NHP
    /// cin>>s1;
    //  modwwe
    phongbeo();
}
int a[2001][2001];
int d[2002];
int b[2001];
int c[2001];

bool solve1(int x)
{
    s3=0;
    s4=0;
    for(int i=1; i<=m; i++)
    {
        s3=max(s3,b[i]);
        for(int j=1; j<=s3; j++)
            s4=max(s4,a[j][i]);
        d[i]=s3;
    }
    if(s4-s2>x)  return 0;
    d[m+1]=n;
    s7=1e9;
    for(int i=m; i>=1; --i)
    {
        while(d[i]<d[i+1]&&a[d[i]+1][i]-s2<=x) d[i]++;
        for(int j=d[i]+1; j<=n; j++)
            s7=min(s7,a[j][i]);
    }
    return s5-s7<=x;

}
bool solve3(int x)
{
     s3=0;
    s4=0;
    for(int i=m; i>=1; i--)
    {
        s3=max(s3,b[i]);
        for(int j=1; j<=s3; j++)
            s4=max(s4,a[j][i]);
        d[i]=s3;
    }
    if(s4-s2>x)  return 0;
    d[m+1]=n;
    d[0]=n;
    s7=1e9;
    for(int i=1; i<=m; ++i)
    {
        while(d[i]<d[i-1]&&a[d[i]+1][i]-s2<=x) d[i]++;
        for(int j=d[i]+1; j<=n; j++)
            s7=min(s7,a[j][i]);
    }
    return s5-s7<=x;
}
bool solve4(int x)
 {
         s3=0;
    s4=1e9;
    for(int i=m; i>=1; i--)
    {
        s3=max(s3,c[i]);
        for(int j=1; j<=s3; j++)
            s4=min(s4,a[j][i]);
        d[i]=s3;
    }
    if(s5-s4>x) return 0;
    d[m+1]=n;
    s7=0;
    d[0]=n;
    for(int i=1; i<=m; ++i)
    {
        while(d[i]<d[i-1]&&s5-a[d[i]+1][i]<=x) d[i]++;
        for(int j=d[i]+1; j<=n; j++)
            s7=max(s7,a[j][i]);
    }
    return s7-s2<=x;
 }
bool solve2(int x)
{
    s3=0;
    s4=1e9;
    for(int i=1; i<=m; i++)
    {
        s3=max(s3,c[i]);
        for(int j=1; j<=s3; j++)
            s4=min(s4,a[j][i]);
        d[i]=s3;
    }
    if(s5-s4>x) return 0;
    d[m+1]=n;
    s7=0;
    for(int i=m; i>=1; --i)
    {
        while(d[i]<d[i+1]&&s5-a[d[i]+1][i]<=x) d[i]++;
        for(int j=d[i]+1; j<=n; j++)
            s7=max(s7,a[j][i]);
    }
    return s7-s2<=x;

}
bool check(int x)
{
    return (((solve1(x)|solve2(x))|solve3(x))|solve4(x));
}
void phongbeo()
{
    cin>>n>>m;
    s2=1e9;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            cin>>a[i][j],s2=min(s2,a[i][j]),s3=max(s3,a[i][j]);
    for(int j=1; j<=m; j++)
        for(int i=1; i<=n; i++)
        {
            if(a[i][j]==s2)
                b[j]=i;
            if(a[i][j]==s3)
                c[j]=i;
        }
    s5=s3;
    s6=s2;
    l=1;
    r=1e9;
    while(l<=r)
    {
        int mid=l+r>>1;
        if(check(mid))r=mid-1;
        else l=mid+1;
    }
    cout<<r+1;
}

Compilation message

joioi.cpp:20:15: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   20 | const int inf=1e18;
      |               ^~~~
joioi.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   49 | main()
      | ^~~~
joioi.cpp: In function 'void phongbeo()':
joioi.cpp:181:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  181 |         int mid=l+r>>1;
      |                 ~^~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 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 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 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 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 5 ms 1488 KB Output is correct
17 Correct 6 ms 1624 KB Output is correct
18 Correct 5 ms 1628 KB Output is correct
19 Correct 5 ms 1628 KB Output is correct
20 Correct 4 ms 1372 KB Output is correct
21 Correct 5 ms 1628 KB Output is correct
22 Correct 4 ms 1808 KB Output is correct
23 Correct 5 ms 1628 KB Output is correct
24 Correct 4 ms 1628 KB Output is correct
25 Correct 5 ms 1628 KB Output is correct
26 Correct 5 ms 1628 KB Output is correct
27 Correct 6 ms 1628 KB Output is correct
28 Correct 5 ms 1628 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 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 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 5 ms 1488 KB Output is correct
17 Correct 6 ms 1624 KB Output is correct
18 Correct 5 ms 1628 KB Output is correct
19 Correct 5 ms 1628 KB Output is correct
20 Correct 4 ms 1372 KB Output is correct
21 Correct 5 ms 1628 KB Output is correct
22 Correct 4 ms 1808 KB Output is correct
23 Correct 5 ms 1628 KB Output is correct
24 Correct 4 ms 1628 KB Output is correct
25 Correct 5 ms 1628 KB Output is correct
26 Correct 5 ms 1628 KB Output is correct
27 Correct 6 ms 1628 KB Output is correct
28 Correct 5 ms 1628 KB Output is correct
29 Correct 1000 ms 37376 KB Output is correct
30 Correct 1096 ms 37600 KB Output is correct
31 Correct 1233 ms 39208 KB Output is correct
32 Correct 977 ms 39168 KB Output is correct
33 Correct 584 ms 34224 KB Output is correct
34 Correct 1031 ms 39276 KB Output is correct
35 Correct 573 ms 54916 KB Output is correct
36 Correct 578 ms 49488 KB Output is correct
37 Correct 574 ms 54864 KB Output is correct