oj.uz

Submission #548344

# Submission time Handle Problem Language Result Execution time Memory
548344 2022-04-13T04:57:01 Z ToroTN Swapping Cities (APIO20_swap) C++14
6 / 100
 133 ms 13048 KB 
#include<bits/stdc++.h>
using namespace std;
#include "swap.h"
#define X first
#define Y second
#define pb push_back

#include <vector>
int n,m,dg[100005],u_i,v_i,w_i,x,y,type=-1,flag=-1;
int node,w,deter=2;
vector<pair<int,int> > g[100005];
vector<pair<int,pair<int,int> > > v;

void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    n=N;
    m=M;
    for(int i=0;i<m;i++)
    {
        u_i=U[i]+1;
        v_i=V[i]+1;
        w_i=W[i];
        g[u_i].pb({v_i,w_i});
        g[v_i].pb({u_i,w_i});
        ++dg[u_i];
        ++dg[v_i];
        v.push_back({-w_i,{u_i,v_i}});
        if(u_i!=1)flag=0;
    }
    sort(v.begin(),v.end());
    for(int i=1;i<=n;i++)
    {
        if(dg[i]>2)
        {
            type=0;
        }
    }
    if(type==-1)
    {
        deter=0;
        for(int i=1;i<=n;i++)if(dg[i]!=2)deter=-1;
    }
}

int getMinimumFuelCapacity(int X, int Y)
{
    x=X+1;
    y=Y+1;
    if(type==-1)
    {
        if(deter==0)return -v[0].X;
        return -1;
    }
    if(m==n-1&&flag==-1)
    {
        if(x==1)return -1;
        if(n<=3)return -1;
        if(x==v[0].Y.Y&&y==v[1].Y.Y||x==v[1].Y.Y&&y==v[0].Y.Y)
        {
            return -v[2].X;
        }
        return max(g[x][0].Y,g[y][0].Y);
    }
}

Compilation message

swap.cpp: In function 'int getMinimumFuelCapacity(int, int)':
swap.cpp:59:23: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   59 |         if(x==v[0].Y.Y&&y==v[1].Y.Y||x==v[1].Y.Y&&y==v[0].Y.Y)
      |                       ^
swap.cpp:65:1: warning: control reaches end of non-void function [-Wreturn-type]
   65 | }
      | ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 45 ms 8708 KB Output is correct
10 Correct 53 ms 9472 KB Output is correct
11 Correct 63 ms 9400 KB Output is correct
12 Correct 64 ms 9644 KB Output is correct
13 Correct 56 ms 9732 KB Output is correct
14 Correct 49 ms 8836 KB Output is correct
15 Correct 106 ms 11160 KB Output is correct
16 Correct 98 ms 11148 KB Output is correct
17 Correct 133 ms 11368 KB Output is correct
18 Correct 114 ms 11440 KB Output is correct
19 Correct 53 ms 7200 KB Output is correct
20 Correct 118 ms 12508 KB Output is correct
21 Correct 112 ms 12460 KB Output is correct
22 Correct 112 ms 12836 KB Output is correct
23 Correct 110 ms 12852 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Incorrect 130 ms 13048 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Incorrect 2 ms 2644 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 45 ms 8708 KB Output is correct
10 Correct 53 ms 9472 KB Output is correct
11 Correct 63 ms 9400 KB Output is correct
12 Correct 64 ms 9644 KB Output is correct
13 Correct 56 ms 9732 KB Output is correct
14 Correct 49 ms 8836 KB Output is correct
15 Correct 106 ms 11160 KB Output is correct
16 Correct 98 ms 11148 KB Output is correct
17 Correct 133 ms 11368 KB Output is correct
18 Correct 114 ms 11440 KB Output is correct
19 Incorrect 130 ms 13048 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -