oj.uz

Submission #1035742

# Submission time Handle Problem Language Result Execution time Memory
1035742 2024-07-26T14:25:01 Z modwwe Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
 7 ms 8384 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".ans","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,s33;
int  i,s10,s12;
int kk;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
   //  fin(task),fou(task);
#endif
    NHP
    /// cin>>s1;
    //  modwwe
    phongbeo();
}
vector<int> v;
vector<int> v2;
int a[100001];
int b[100001];
int c[100002];
int dp[1001][1001];
void phongbeo()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++) cin>>a[i];
    for(int i=1; i<=m; i++) cin>>b[i];
    c[0]=inf;
    for(int i=1; i<=n; i++)
    {
        if(a[i]<c[i-1])
            c[i]=a[i],v.pb(i);
        else c[i]=c[i-1];
    }
    c[0]=inf;
    for(int i=1; i<=m; i++)
    {
        if(b[i]<c[i-1])
            c[i]=b[i],v2.pb(i);
        else c[i]=c[i-1];
    }
    s5=v.back();
    s6=v2.back();
    l=0;
    r=0;
    s4=0;
    c[n+1]=inf;
    for(int i=n; i>=1; --i){
            if(i==s5) break;
        if(a[i]<c[i+1])
            c[i]=a[i],v.pb(i);
        else c[i]=c[i+1];}
    c[m+1]=inf;
    for(int i=m; i>=1; --i){
            if(i==s6) break;
        if(b[i]<c[i+1])
            c[i]=b[i],v2.pb(i);
        else c[i]=c[i+1];}
sort(v.begin(),v.end());
sort(v2.begin(),v2.end());
for(int i=0;i<v.size();i++)
    for(int j=0;j<v2.size();j++)
    dp[i][j]=inf;
dp[0][0]=0;
    for(int i=0;i<v.size();i++)
    for(int j=0;j<v2.size();j++){
     if(i!=v.size()-1)dp[i+1][j]=min(dp[i+1][j],dp[i][j]+(v[i+1]-v[i])*b[v2[j]]);
     if(j!=v2.size()-1) dp[i][j+1]=min(dp[i][j+1],dp[i][j]+(v2[j+1]-v2[j])*a[v[i]]);
    }
    cout<<dp[v.size()-1][v2.size()-1];
}

Compilation message

kyoto.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   49 | main()
      | ^~~~
kyoto.cpp: In function 'void phongbeo()':
kyoto.cpp:103:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 | for(int i=0;i<v.size();i++)
      |             ~^~~~~~~~~
kyoto.cpp:104:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |     for(int j=0;j<v2.size();j++)
      |                 ~^~~~~~~~~~
kyoto.cpp:107:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
kyoto.cpp:108:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |     for(int j=0;j<v2.size();j++){
      |                 ~^~~~~~~~~~
kyoto.cpp:109:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |      if(i!=v.size()-1)dp[i+1][j]=min(dp[i+1][j],dp[i][j]+(v[i+1]-v[i])*b[v2[j]]);
      |         ~^~~~~~~~~~~~
kyoto.cpp:110:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |      if(j!=v2.size()-1) dp[i][j+1]=min(dp[i][j+1],dp[i][j]+(v2[j+1]-v2[j])*a[v[i]]);
      |         ~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 464 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 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 7 ms 8376 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 0 ms 732 KB Output is correct
16 Correct 6 ms 8384 KB Output is correct
17 Correct 0 ms 348 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 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 2 ms 2652 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 464 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 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 7 ms 8376 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 0 ms 732 KB Output is correct
16 Correct 6 ms 8384 KB Output is correct
17 Correct 0 ms 348 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 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Incorrect 2 ms 2652 KB Output isn't correct
32 Halted 0 ms 0 KB -