# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
240930 | SamAnd | Telefoni (COCI17_telefoni) | C++17 | 33 ms | 2048 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 300005;
int n, d;
int a[N];
void solv()
{
scanf("%d%d", &n, &d);
for (int i = 1; i <= n; ++i)
{
scanf("%d", &a[i]);
}
int ans = 0;
int u;
for (int i = 1; i <= n; ++i)
{
if (a[i] == 1)
{
u = i;
continue;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |