Submission #1139713

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1139713	2025-01-25 11:19:40	adelina	Monthly railway pass (LMIO18_menesinis_bilietas)	C++20	46 / 100	3092 ms	31176 KiB

menesinis_bilietas

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int Nmax = 5e5 + 5;
vector<pair<int, int>>g[Nmax];
int drum[Nmax];
int n;
void bfs(int nod)
{
    deque<int>de;
    for(int i = 0; i <= n; i ++)
        drum[i] = 1e9;
    drum[nod] = 0;
    de.push_front(nod);
    while(!de.empty())
    {
        nod = de.front();
        de.pop_front();
        for(auto it: g[nod])
            if(drum[nod] + it.second < drum[it.first])
            {
                drum[it.first] = drum[nod] + it.second;
                if(it.second == 0)
                    de.push_front(it.first);
                else
                    de.push_back(it.first);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 6 / 6
• Subtask 3: 30 / 30
• Subtask 4: 0 / 35
• Subtask 5: 0 / 19