oj.uz

답안 #943594

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
943594 2024-03-11T16:04:49 Z andrei_boaca Sightseeing in Kyoto (JOI22_kyoto) C++17
100 / 100
 1242 ms 35416 KB 
#include <bits/stdc++.h>

using namespace std;
ifstream fin("date.in");
ofstream fout("date.out");
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
ll n,m;
ll A[100005],B[100005];
set<ll> lines,cols;
auto comp = [](vector<ll> a, vector<ll> b)
{
    if(a[0]*b[1]!=a[1]*b[0])
        return a[0]*b[1]<a[1]*b[0];
    if(a[0]!=b[0])
        return a[0]<b[0];
    if(a[1]!=b[1])
        return a[1]<b[1];
    if(a[2]!=b[2])
        return a[2]<b[2];
    return a[3]<b[3];
};
multiset<vector<ll>,decltype(comp)> setik(comp); /// 0 -> linie, 1 -> coloana
pll getval(ll a,ll b)
{
    //assert(b!=0);
    /*if(a==0)
        return {0,1};
    ll g=__gcd(a,b);
    a/=g;
    b/=g;*/
    return {a,b};
}
void elimlin(ll poz)
{
    auto it=lines.find(poz);
    ll st=0,dr=0;
    if(it!=lines.begin())
        st=*prev(it);
    it++;
    if(it!=lines.end())
    {
        dr=(*it);
        //assert(dr>poz);
    }
    lines.erase(poz);
    if(st!=0)
    {
        bool prost=0;
        if(st>=poz)
            prost=1;
        //assert(poz>st);
        pll val=getval(A[poz]-A[st],poz-st);
        setik.erase({val.first,val.second,poz,0});
    }
    if(dr!=0)
    {
        //assert(poz<dr);
        pll val=getval(A[dr]-A[poz],dr-poz);
        setik.erase({val.first,val.second,dr,0});
    }
    if(st!=0&&dr!=0)
    {
        //assert(st<dr);
        pll val=getval(A[dr]-A[st],dr-st);
        setik.insert({val.first,val.second,dr,0});
    }
}
void elimcol(ll poz)
{
    bool ok=0;
    if(poz==450)
    {
        //cout<<"a trecut pe aici\n";
        ok=1;
    }
    auto it=cols.find(poz);
    ll st=0,dr=0;
    if(it!=cols.begin())
        st=*prev(it);
    it++;
    if(it!=cols.end())
    {
        dr=(*it);
        //assert(dr>poz);
    }
    cols.erase(poz);
    if(st!=0)
    {
        bool prost=0;
        if(st>=poz)
            prost=1;
        //assert(st<poz);
        pll val=getval(B[poz]-B[st],poz-st);
        setik.erase({val.first,val.second,poz,1});
    }
    if(dr!=0)
    {
        //assert(dr>poz);
        pll val=getval(B[dr]-B[poz],dr-poz);
        setik.erase({val.first,val.second,dr,1});
    }
    if(st!=0&&dr!=0)
    {
        //assert(st<dr);
        pll val=getval(B[dr]-B[st],dr-st);
        setik.insert({val.first,val.second,dr,1});
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>A[i];
        lines.insert(i);
    }
    for(int i=1;i<=m;i++)
    {
        cin>>B[i];
        cols.insert(i);
    }
    ll cnt=2;
    ll x=n;
    ll y=m;
    for(int i=2;i<=n;i++)
    {
        bool ok=0;
        if(i==305)
            ok=1;
        vector<ll> v={A[i]-A[i-1],1,i,0};
        ll val=v[2];
        setik.insert({A[i]-A[i-1],1,i,0});
        //cout<<i<<": "<<setik.count({33,1,306,0})<<'\n';
    }
    //return 0;
    for(int i=2;i<=m;i++)
        setik.insert({B[i]-B[i-1],1,i,1});
    ll ans=0;
    while(lines.size()>=2||cols.size()>=2)
    {
        bool ok=0;
        int lg=(int)lines.size()+(int)cols.size()-2;
        int L=setik.size();
        if(setik.size()!=(int)lines.size()+(int)cols.size()-2)
            ok=1;
        assert(!setik.empty());
        auto it=prev(setik.end());
        if((*it)[3]==0) /// linie
        {
            ll poz=(*it)[2];
            if(poz==x)
                cnt--;
            if(cnt==0)
            {
                ll aux=*prev(cols.end());
                ans+=(y-aux)*A[poz];
                y=aux;
                cnt=1;
            }
            elimlin(poz);
        }
        else /// coloana
        {
            ll poz=(*it)[2];
            if(poz==y)
                cnt--;
            if(cnt==0)
            {
                ll aux=*prev(lines.end());
                ans+=(x-aux)*B[poz];
                x=aux;
                cnt=1;
            }
            elimcol(poz);
        }
    }
    ans+=(x-1)*B[1]+(y-1)*A[1];
    cout<<ans;
    return 0;
}

Compilation message

kyoto.cpp: In function 'void elimlin(ll)':
kyoto.cpp:50:14: warning: variable 'prost' set but not used [-Wunused-but-set-variable]
   50 |         bool prost=0;
      |              ^~~~~
kyoto.cpp: In function 'void elimcol(ll)':
kyoto.cpp:91:14: warning: variable 'prost' set but not used [-Wunused-but-set-variable]
   91 |         bool prost=0;
      |              ^~~~~
kyoto.cpp:72:10: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
   72 |     bool ok=0;
      |          ^~
kyoto.cpp: In function 'int main()':
kyoto.cpp:131:14: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
  131 |         bool ok=0;
      |              ^~
kyoto.cpp:135:12: warning: unused variable 'val' [-Wunused-variable]
  135 |         ll val=v[2];
      |            ^~~
kyoto.cpp:148:24: warning: comparison of integer expressions of different signedness: 'std::multiset<std::vector<long long int>, <lambda(std::vector<long long int>, std::vector<long long int>)> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  148 |         if(setik.size()!=(int)lines.size()+(int)cols.size()-2)
      |            ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
kyoto.cpp:145:14: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
  145 |         bool ok=0;
      |              ^~
kyoto.cpp:146:13: warning: unused variable 'lg' [-Wunused-variable]
  146 |         int lg=(int)lines.size()+(int)cols.size()-2;
      |             ^~
kyoto.cpp:147:13: warning: unused variable 'L' [-Wunused-variable]
  147 |         int L=setik.size();
      |             ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 3 ms 604 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 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 5 ms 600 KB Output is correct
10 Correct 5 ms 604 KB Output is correct
11 Correct 5 ms 604 KB Output is correct
12 Correct 8 ms 604 KB Output is correct
13 Correct 5 ms 604 KB Output is correct
14 Correct 5 ms 600 KB Output is correct
15 Correct 5 ms 604 KB Output is correct
16 Correct 5 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 740 KB Output is correct
4 Correct 338 ms 14100 KB Output is correct
5 Correct 300 ms 13248 KB Output is correct
6 Correct 106 ms 5968 KB Output is correct
7 Correct 1123 ms 34084 KB Output is correct
8 Correct 1242 ms 34084 KB Output is correct
9 Correct 1097 ms 34096 KB Output is correct
10 Correct 1207 ms 34108 KB Output is correct
11 Correct 681 ms 34024 KB Output is correct
12 Correct 1158 ms 34104 KB Output is correct
13 Correct 1171 ms 34324 KB Output is correct
14 Correct 1035 ms 34084 KB Output is correct
15 Correct 355 ms 34132 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 468 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 472 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 3 ms 604 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 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 5 ms 600 KB Output is correct
10 Correct 5 ms 604 KB Output is correct
11 Correct 5 ms 604 KB Output is correct
12 Correct 8 ms 604 KB Output is correct
13 Correct 5 ms 604 KB Output is correct
14 Correct 5 ms 600 KB Output is correct
15 Correct 5 ms 604 KB Output is correct
16 Correct 5 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 3 ms 740 KB Output is correct
32 Correct 338 ms 14100 KB Output is correct
33 Correct 300 ms 13248 KB Output is correct
34 Correct 106 ms 5968 KB Output is correct
35 Correct 1123 ms 34084 KB Output is correct
36 Correct 1242 ms 34084 KB Output is correct
37 Correct 1097 ms 34096 KB Output is correct
38 Correct 1207 ms 34108 KB Output is correct
39 Correct 681 ms 34024 KB Output is correct
40 Correct 1158 ms 34104 KB Output is correct
41 Correct 1171 ms 34324 KB Output is correct
42 Correct 1035 ms 34084 KB Output is correct
43 Correct 355 ms 34132 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 468 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 0 ms 472 KB Output is correct
55 Correct 421 ms 15828 KB Output is correct
56 Correct 3 ms 600 KB Output is correct
57 Correct 25 ms 1880 KB Output is correct
58 Correct 77 ms 4952 KB Output is correct
59 Correct 1212 ms 35256 KB Output is correct
60 Correct 1143 ms 35256 KB Output is correct
61 Correct 1124 ms 35268 KB Output is correct
62 Correct 1159 ms 35276 KB Output is correct
63 Correct 402 ms 35188 KB Output is correct
64 Correct 1067 ms 35156 KB Output is correct
65 Correct 1062 ms 35348 KB Output is correct
66 Correct 775 ms 35256 KB Output is correct
67 Correct 360 ms 35416 KB Output is correct