fork download

copy

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<set>
#include<queue>
#include<vector>
#include<cmath>
#include<map>
 
using namespace std;
 
const int maxi=2*(1e6+10);
 
priority_queue <pair<long long ,int>> pq[maxi];
vector <int> g[maxi],ds[maxi];
set <long long> st[maxi];
vector <pair<int,int>> mp[maxi];
map <pair<int,int>, int> c,ob;
long long  ans[maxi];
int gr[maxi];
pair<long long , pair<int,int>> v[maxi];
int x,y,n,m,q;
long long z;
long long b[maxi],cnt[maxi];
 
 
void spoj(int x, int y,int z)
{
 
   if (x!=y)
   {
    if (ds[x].size()>=ds[y].size())
     swap(x,y);
 
  for (int i=0;i<ds[x].size();i++)
    for (int j=0;j<g[ds[x][i]].size();j++)
       {
           int u=0;
           u=g[ds[x][i]][j];
           if (gr[u]==y && c[{ds[x][i],u}])
        {
            int o1=0;
            o1 =c[{ds[x][i],u}];
             for (int w=0;w<mp[o1].size();w++)
             pq[y].push(mp[o1][w]);
        }
 
       }
            for (int i=0;i<ds[x].size();i++)
            {
               ds[y].push_back(ds[x][i]);
               st[y].insert(b[ds[x][i]]);
               gr[ds[x][i]]=y;
            }
 
            st[x].clear();
            ds[x].clear();
 
            while(!pq[x].empty())
             {
                 int p=0;
                 int p1=0;
                  p=pq[x].top().first;
                  p1=pq[x].top().second;
                 pq[y].push({p,p1});
                 pq[x].pop();
             }
 
             while(!pq[y].empty() && abs(pq[y].top().first)<=st[y].size())
             {
                 ans[pq[y].top().second]=z;
                 pq[y].pop();
             }
    }
}
 
int main()
{
    scanf("%d%d%d",&n,&m,&q);
 
    for (int i=1;i<=n;i++)
     scanf("%lld",&b[i]);
 
    for (int i=1;i<=n;i++)
    {
        ds[i].push_back(i);
        st[i].insert(b[i]);
        gr[i]=i;
    }
 int p=0;
    for (int i=0;i<m;i++)
    {
         scanf("%d%d%d",&x,&y,&z);
         if (!ob[{x,y}])
            {
 
                p++;
 
            ob[{x,y}]=1;
            ob[{y,x}]=1;
         v[p-1]={z,{x,y}};
         g[x].push_back(y);
         g[y].push_back(x);
            }
    }
 
 
    sort(v,v+p);
 
for (int i=1;i<=q;i++)
            ans[i]=-1;
 int o=0;
    for (int i=1;i<=q;i++)
    {
        scanf("%d%d%lld",&x,&y,&z);
        if (x==y)
        {
            if (z<=1)  {
                ans[i]=0;
                cnt[i]=1;
            }
            else
            pq[x].push({-z,i});
        } else
        {
        if (c[{x,y}]==0)  {
            o++;
        c[{x,y}]=o;
        }
        mp[c[{x,y}]].push_back({-z,i});
        if (c[{y,x}]==0)  {
        o++;
        c[{y,x}]=o;
        }
        mp[c[{y,x}]].push_back({-z,i});
     }
    }
 
    for (int i=0;i<p;i++)
        spoj(gr[v[i].second.first],gr[v[i].second.second],v[i].first);
 
  for (int i=1;i<=q;i++)
    printf("%lld\n",ans[i]);
 
    return 0;
}
 

prog.cpp:14:36: error: a space is required between consecutive right angle brackets (use '> >')
priority_queue <pair<long long ,int>> pq[maxi];
                                   ^~
                                   > >
prog.cpp:17:21: error: a space is required between consecutive right angle brackets (use '> >')
vector <pair<int,int>> mp[maxi];
                    ^~
                    > >
prog.cpp:21:30: error: a space is required between consecutive right angle brackets (use '> >')
pair<long long , pair<int,int>> v[maxi];
                             ^~
                             > >
prog.cpp:40:30: error: expected expression
           if (gr[u]==y && c[{ds[x][i],u}])
                             ^
prog.cpp:40:30: error: expected ']'
prog.cpp:40:29: note: to match this '['
           if (gr[u]==y && c[{ds[x][i],u}])
                            ^
prog.cpp:43:19: error: expected expression
            o1 =c[{ds[x][i],u}];
                  ^
prog.cpp:43:19: error: expected ']'
prog.cpp:43:18: note: to match this '['
            o1 =c[{ds[x][i],u}];
                 ^
prog.cpp:65:29: error: expected expression
                 pq[y].push({p,p1});
                            ^
prog.cpp:93:31: warning: format specifies type 'int *' but the argument has type 'long long *' [-Wformat]
         scanf("%d%d%d",&x,&y,&z);
                    ~~        ^~
                    %lld
prog.cpp:94:18: error: expected expression
         if (!ob[{x,y}])
                 ^
prog.cpp:94:18: error: expected ']'
prog.cpp:94:17: note: to match this '['
         if (!ob[{x,y}])
                ^
prog.cpp:99:16: error: expected expression
            ob[{x,y}]=1;
               ^
prog.cpp:99:16: error: expected ']'
prog.cpp:99:15: note: to match this '['
            ob[{x,y}]=1;
              ^
prog.cpp:100:16: error: expected expression
            ob[{y,x}]=1;
               ^
prog.cpp:100:16: error: expected ']'
prog.cpp:100:15: note: to match this '['
            ob[{y,x}]=1;
              ^
prog.cpp:101:17: error: expected expression
         v[p-1]={z,{x,y}};
                ^
prog.cpp:123:24: error: expected expression
            pq[x].push({-z,i});
                       ^
prog.cpp:126:15: error: expected expression
        if (c[{x,y}]==0)  {
              ^
prog.cpp:126:15: error: expected ']'
prog.cpp:126:14: note: to match this '['
        if (c[{x,y}]==0)  {
             ^
prog.cpp:128:11: error: expected expression
        c[{x,y}]=o;
          ^
fatal error: too many errors emitted, stopping now [-ferror-limit=]
1 warning and 20 errors generated.

Standard output is empty