Submission #1305422

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305422		yus1f_m	Race (IOI11_race)	C++20	9 / 100	3096 ms	1828 KiB

race

//pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "race.h"
const int sz=1000000,INF=1000000000;
using namespace std;
int best_path(int n,int m,int nums1[][2],int nums2[])
{
    int ans=INF;
    vector<int>prefs(n+1,0);
    for(int i=0;i<n;i++)
    {
        prefs[i+1]=prefs[i]+nums2[i];
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=i;j<=n;j++)
        {
            if(prefs[j]-prefs[i-1]==m)
            {
                ans=min(ans,j-i+1);
            }
        }
    }
    if(ans==INF)
    {
        ans=-1;
    }
    return ans;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57