oj.uz

Submission #914167

# Submission time Handle Problem Language Result Execution time Memory
914167 2024-01-21T10:12:55 Z andrei_iorgulescu Robot (JOI21_ho_t4) C++17
34 / 100
 3000 ms 155240 KB 
#include <bits/stdc++.h>

using namespace std;
using namespace chrono;

using ll = long long;

ll inf = 1e18;

struct ura
{
    int x,y,culoare,pret;
};

vector<ura>muchii;
int n,m;
map<pair<int,int>,int>cul,cost;
set<int>culori[100005];
vector<ll>d[100005];
vector<vector<pair<pair<int,int>,ll>>>g[100005];
map<pair<int,int>,int>idkmap;
map<pair<int,int>,ll>sumcost;

void putedge(int x,int y)
{
    //cout << x << ' ' << y << endl;
    int c = cul[{x,y}];
    int pret = cost[{x,y}];
    ///(x,0) -> (y,0)
    ll cost1 = pret;
    ll cost2 = sumcost[{x,c}] - cost1;
    ll act_cost = min(cost1,cost2);
    g[x][0].push_back({{y,0},act_cost});
    //cout << "1" << endl;
    ///(x,0) -> (y,c)
    g[x][0].push_back({{y,idkmap[{y,c}]},0});
    //cout << "2" << endl;
    ///(x,c) -> (y,0)
    act_cost = sumcost[{x,c}] - cost1;
    g[x][idkmap[{x,c}]].push_back({{y,0},act_cost});
    //cout << "3" << endl;
}

signed main()
{
    auto primul_moment = high_resolution_clock::now();
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x,y,culoare,pret;
        cin >> x >> y >> culoare >> pret;
        sumcost[{x,culoare}] += pret;
        sumcost[{y,culoare}] += pret;
        ura aux;
        aux.x = x;
        aux.y = y;
        aux.culoare = culoare;
        aux.pret = pret;
        muchii.push_back(aux);
        cul[{x,y}] = cul[{y,x}] = culoare;
        cost[{x,y}] = cost[{y,x}] = pret;
        culori[x].insert(culoare);
        culori[y].insert(culoare);
    }
    for (int i = 1; i <= n; i++)
    {
        d[i].resize(culori[i].size() + 1);
        //c[i].resize(culori[i].size() + 1);
        for (int j = 0; j <= culori[i].size(); j++)
            d[i][j] = inf;
        g[i].resize(culori[i].size() + 1);
        int jjj = 0;
        for (auto it : culori[i])
        {
            jjj++;
            //c[i][jjj] = it;
            idkmap[{i,it}] = jjj;
        }
    }
    auto al_doilea_moment = high_resolution_clock::now();
    auto cat_a_durat = duration_cast<milliseconds>(al_doilea_moment - primul_moment);
    if (cat_a_durat.count() >= 2000)
        assert(false);
    for (auto it : muchii)
    {
        putedge(it.x,it.y);
        putedge(it.y,it.x);
    }
    priority_queue<pair<ll,pair<int,int>>>pq;
    pq.push({0,{1,0}});
    while (!pq.empty())
    {
        pair<int,int>nod = pq.top().second;
        ll timp = -pq.top().first;
        pq.pop();
        if (d[nod.first][nod.second] == inf)
        {
            d[nod.first][nod.second] = timp;
            if (nod.first == n and nod.second == 0)
                break;
            for (auto vecin : g[nod.first][nod.second])
            {
                pair<ll,pair<int,int>>de_bagat;
                de_bagat.first = -(timp + vecin.second);
                de_bagat.second = vecin.first;
                pq.push(de_bagat);
            }
        }
    }
    if (d[n][0] == inf)
        cout << -1;
    else
        cout << d[n][0];
    return 0;
}

/**
Stari: {nod,-1}, {nod,cul}, [nod,cul]
le definesc prin pereche (nod,-1 sau ceva intre 1 si m sau ceva intre 1 si 2m)
pentru nod, pot avea (nod,-1), (nod,c din culori[nod]) sau (nod, m + c din culori[nod])

Tranzitii:
(nod,-1) -> (vecin,-1) cost = min(toate muchiile adiacente cu nod de culoarea cul[{nod,vecin}] mai putin fix muchia {nod,vecin}, cost[{nod,vecin}])
(nod,-1) -> (vecin, cul[{nod,vecin}]) de cost 0
(nod,c) -> (vecin,-1) de cost toate muchiile adiacente cu nod de culoarea c mai putin fix muchia {nod,vecin}, conditie: cul[{nod,vecin}] = c

initial (1,-1) = 0
raspunsul este (n,-1)
**/

/**
graful asta are n + 2m noduri cel mult
(nod,c) pot sa pp ca are doar muchii de culoarea c
atunci numarul de muchii este 2m + 2m + 2m = 6m muchii
pe care dau un dijksta finut, iese N = n + 2m si M = 6m, iese MlogM + N
**/

/**
cum tin graful?
pai am o matrice de stari
la o linie am asa:
(nod,0) reprezinta (nod,-1)
(nod,1),(nod,2),...,(nod,k[nod]) reprezinta culorile din nod
**/

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:72:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::set<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         for (int j = 0; j <= culori[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9820 KB Output is correct
2 Correct 3 ms 9816 KB Output is correct
3 Correct 3 ms 9824 KB Output is correct
4 Correct 3 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 4 ms 9820 KB Output is correct
7 Correct 9 ms 10332 KB Output is correct
8 Correct 4 ms 10072 KB Output is correct
9 Correct 16 ms 11352 KB Output is correct
10 Correct 10 ms 11100 KB Output is correct
11 Correct 8 ms 11124 KB Output is correct
12 Correct 8 ms 10840 KB Output is correct
13 Correct 10 ms 11100 KB Output is correct
14 Correct 9 ms 11100 KB Output is correct
15 Correct 6 ms 10332 KB Output is correct
16 Correct 9 ms 10844 KB Output is correct
17 Correct 9 ms 10844 KB Output is correct
18 Correct 5 ms 10332 KB Output is correct
19 Correct 8 ms 10844 KB Output is correct
20 Correct 7 ms 10584 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 746 ms 61756 KB Output is correct
2 Correct 267 ms 34176 KB Output is correct
3 Correct 1152 ms 74752 KB Output is correct
4 Correct 386 ms 42952 KB Output is correct
5 Execution timed out 3103 ms 155240 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9820 KB Output is correct
2 Correct 3 ms 9816 KB Output is correct
3 Correct 3 ms 9824 KB Output is correct
4 Correct 3 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 4 ms 9820 KB Output is correct
7 Correct 9 ms 10332 KB Output is correct
8 Correct 4 ms 10072 KB Output is correct
9 Correct 16 ms 11352 KB Output is correct
10 Correct 10 ms 11100 KB Output is correct
11 Correct 8 ms 11124 KB Output is correct
12 Correct 8 ms 10840 KB Output is correct
13 Correct 10 ms 11100 KB Output is correct
14 Correct 9 ms 11100 KB Output is correct
15 Correct 6 ms 10332 KB Output is correct
16 Correct 9 ms 10844 KB Output is correct
17 Correct 9 ms 10844 KB Output is correct
18 Correct 5 ms 10332 KB Output is correct
19 Correct 8 ms 10844 KB Output is correct
20 Correct 7 ms 10584 KB Output is correct
21 Correct 746 ms 61756 KB Output is correct
22 Correct 267 ms 34176 KB Output is correct
23 Correct 1152 ms 74752 KB Output is correct
24 Correct 386 ms 42952 KB Output is correct
25 Execution timed out 3103 ms 155240 KB Time limit exceeded
26 Halted 0 ms 0 KB -