UVa-solutions/10449.cpp at master · amitpriyankar/UVa-solutions · GitHub

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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include<bits/stdc++.h>
using namespace std;
int INF=INT_MAX;
struct edge{
    int x;
    int y;
    long long cost;
};
int main()
{
    int ct=0;
    int n;
    while(cin>>n)
    {
        int arr[n];
        for(int i=0; i<n ;i++)cin>>arr[i];
        vector<edge> adj;
        int r;
        cin>>r;
        int kk=r;
        int aa,bb;
        while(kk--)
        {
            cin>>aa>>bb;
            struct edge amit;
            amit.x=aa;
            amit.y=bb;
            int i=arr[aa-1];
            int j=arr[bb-1];
            amit.cost=(j-i)*(j-i)*(j-i);
            adj.push_back(amit);
        }
        int q;
        vector<long long>d(n+1,INF);
        d[1]=0;
        int check;

        for(int l=0; l<n-1; l++)
        {
            check=-1;

            for(int i=0; i<r; i++)
            {
                if(d[adj[i].x]<INF)
                if(d[adj[i].x]+adj[i].cost<d[adj[i].y])
                {

                    d[adj[i].y]=max(-(long long)INF,d[adj[i].x]+adj[i].cost);
                    check=1;
                }
            }
        }
     for(int i=0; i<r; i++)
            {
                if(d[adj[i].x]<INF)
                if(d[adj[i].x]+adj[i].cost<d[adj[i].y])
                {

                    d[adj[i].y]=-INF;
                    check=1;
                }
            }
        int qq,pp;
        cin>>qq;
        ct++;
        cout<<"Set #"<<ct<<endl;
        vector<int> ans;
        while(qq--)
        {
            cin>>pp;


        }

    }
}