Submission #1328731

#TimeUsernameProblemLanguageResultExecution timeMemory
1328731QuocSensei철로 (IOI14_rail)C++20
8 / 100
32 ms588 KiB
#include "rail.h"
#include <bits/stdc++.h>

#define ll long long 
#define el cout << endl
#define ii pair<int, int>
#define fi first 
#define se second

using namespace std;

const int maxn = 5e3;

namespace SUBTASK_1
{
    void solve(int n, int first, int location[], int type[])
    {
        for (int i = 0; i < n; i++)
        {
            if (i == 0)
            {
                type[i] = 1;
                location[i] = first;
                continue;
            }
            location[i] = getDistance(0, i) + first;
            type[i] = 2;
        }
    }
}

void findLocation(int n, int first, int location[], int stype[])
{
    SUBTASK_1::solve(n, first, location, stype);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...