oj.uz

Submission #600359

# Submission time Handle Problem Language Result Execution time Memory
600359 2022-07-20T19:14:04 Z amin Roller Coaster Railroad (IOI16_railroad) C++14
11 / 100
 2000 ms 6720 KB 
#include "railroad.h"
#include<bits/stdc++.h>

using namespace std;

long long n,m;
long long an=1e18;
long long a[20],b[20],j[20];
void tr(vector<long>v)
{
    for(long i=0;i<n;i++)
    {
        j[i]=0;
    }
    for(long i=0;i<n;i++)
    {
        j[v[i]]++;
        if(j[v[i]]>1)
            return ;
    }

   // cout<<v.size()<<endl;
    long long sum=0;
    for(long i=0;i<n-1;i++)
    {
        if((b[v[i]]-a[v[i+1]])>0)
        {
          //  cout<<a[v[i]]<<' '<<b[v[i+1]]<<endl;
            sum+=(b[v[i]]-a[v[i+1]]);
        }
    }
   // cout<<endl;
    an=min(an,sum);
    return ;
}
void rec(long o,vector<long>v)
{
    if(o==n)
    {
        tr(v);
        return ;
    }

    long r=0;
    for(long i=0;i<n;i++)
    {

        v.push_back(i);
        rec(o+1,v);
        v.pop_back();

    }
    return ;
}
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
     n =  s.size();
     m=t.size();
    for(long i=0;i<n;i++)
    {
        a[i]=s[i];
    }
    for(long i=0;i<n;i++)
    {
        b[i]=t[i];
    }
    rec(0,{});
    return an;
}

Compilation message

railroad.cpp: In function 'void rec(long int, std::vector<long int>)':
railroad.cpp:44:10: warning: unused variable 'r' [-Wunused-variable]
   44 |     long r=0;
      |          ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 0 ms 232 KB n = 3
10 Correct 1181 ms 288 KB n = 8
11 Correct 1188 ms 272 KB n = 8
12 Correct 1240 ms 276 KB n = 8
13 Correct 1218 ms 276 KB n = 8
14 Correct 1188 ms 276 KB n = 8
15 Correct 1205 ms 272 KB n = 8
16 Correct 1199 ms 276 KB n = 8
17 Correct 1205 ms 276 KB n = 8
18 Correct 1263 ms 280 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 67 ms 276 KB n = 7
21 Correct 1264 ms 272 KB n = 8
22 Correct 1195 ms 280 KB n = 8
23 Correct 1179 ms 272 KB n = 8
24 Correct 1173 ms 276 KB n = 8
25 Correct 1183 ms 272 KB n = 8

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 0 ms 232 KB n = 3
10 Correct 1181 ms 288 KB n = 8
11 Correct 1188 ms 272 KB n = 8
12 Correct 1240 ms 276 KB n = 8
13 Correct 1218 ms 276 KB n = 8
14 Correct 1188 ms 276 KB n = 8
15 Correct 1205 ms 272 KB n = 8
16 Correct 1199 ms 276 KB n = 8
17 Correct 1205 ms 276 KB n = 8
18 Correct 1263 ms 280 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 67 ms 276 KB n = 7
21 Correct 1264 ms 272 KB n = 8
22 Correct 1195 ms 280 KB n = 8
23 Correct 1179 ms 272 KB n = 8
24 Correct 1173 ms 276 KB n = 8
25 Correct 1183 ms 272 KB n = 8
26 Correct 1186 ms 276 KB n = 8
27 Correct 1203 ms 280 KB n = 8
28 Correct 1308 ms 272 KB n = 8
29 Execution timed out 2087 ms 212 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 40 ms 6720 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 0 ms 232 KB n = 3
10 Correct 1181 ms 288 KB n = 8
11 Correct 1188 ms 272 KB n = 8
12 Correct 1240 ms 276 KB n = 8
13 Correct 1218 ms 276 KB n = 8
14 Correct 1188 ms 276 KB n = 8
15 Correct 1205 ms 272 KB n = 8
16 Correct 1199 ms 276 KB n = 8
17 Correct 1205 ms 276 KB n = 8
18 Correct 1263 ms 280 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 67 ms 276 KB n = 7
21 Correct 1264 ms 272 KB n = 8
22 Correct 1195 ms 280 KB n = 8
23 Correct 1179 ms 272 KB n = 8
24 Correct 1173 ms 276 KB n = 8
25 Correct 1183 ms 272 KB n = 8
26 Correct 1186 ms 276 KB n = 8
27 Correct 1203 ms 280 KB n = 8
28 Correct 1308 ms 272 KB n = 8
29 Execution timed out 2087 ms 212 KB Time limit exceeded
30 Halted 0 ms 0 KB -