oj.uz

답안 #984770

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984770 2024-05-17T05:17:57 Z Muhammad_Aneeq 사이버랜드 (APIO23_cyberland) C++17
21 / 100
 31 ms 9308 KB 
#include "cyberland.h"
#include <vector>
#include <map>
#include <set>
#include <iostream>
using namespace std;
int const MAXN=1e5+10;
vector<pair<int,int>>nei[MAXN];
int val[MAXN];
double dis[MAXN]={};
bool vis[MAXN]={},ra[MAXN]={};
int h;
double ans=1e15+10;
map<pair<int,int>,int>d;
void dfs(int x)
{
    ra[x]=1;
    vis[x]=1;
    for (auto [i,j]:nei[x])
    {
        if (!vis[i]&&i!=h)
            dfs(i);
    }
}
vector<int>p;
int k;
void bfs(int x)
{
      set<pair<int,int>>S;
      dis[x]=0;
      S.insert({dis[x],x});
      while (S.size())
      {
        int z=(*begin(S)).second;
        S.erase(*begin(S));
        if (vis[z])
            continue;
        vis[z]=1;
        if (val[z]==0||z==0)
        {
            ans=min(ans,dis[z]);continue;
        }
        for (auto [i,j]:nei[z])
        {
            if (ra[i]&&dis[i]>dis[z]+j)
            {
                dis[i]=dis[z]+j;
                S.insert({dis[i],i});
            }
        }
      }
}
double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) 
{
    ans=1e15+10;
    h=H;
    k=K;
    d={};
    p={};
    bool tw=0;
    for (int i=0;i<N;i++)
    {
        nei[i]={};
        val[i]=arr[i];
        vis[i]=0;
        dis[i]=1e15+10;
        ra[i]=0;
        if (val[i]==2)
            tw=1;
    }
    if (tw)
    {
        for (int i=H-1;i>=0;i--)
        {
            if (val[i]==0)
                break;
            if (val[i]==2&&k)
            {
                k-=1;
                vis[i]=1;
            }
        }
        double su=0;
        for (int i=0;i<H;i++)
        {
            if (vis[i])
                su/=2.0;
            if (val[i]==0)
                su=0;
            su+=c[i];
        }
        return su;
    }
    for (int i=0;i<x.size();i++)
    {  
        nei[x[i]].push_back({y[i],c[i]});
        nei[y[i]].push_back({x[i],c[i]});
    }
    dfs(0);
    for (int i=0;i<N;i++)
        vis[i]=0;
    bfs(h);
    if (ans==1e15+10)
        return -1;
    return ans;
}

Compilation message

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:94:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |     for (int i=0;i<x.size();i++)
      |                  ~^~~~~~~~~

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 4 ms 7772 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 4172 KB Correct.
2 Correct 21 ms 3932 KB Correct.
3 Correct 20 ms 3932 KB Correct.
4 Correct 20 ms 3932 KB Correct.
5 Correct 27 ms 4140 KB Correct.
6 Correct 17 ms 4696 KB Correct.
7 Correct 23 ms 4736 KB Correct.
8 Correct 14 ms 5468 KB Correct.
9 Correct 18 ms 3928 KB Correct.
10 Correct 18 ms 3928 KB Correct.

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 3932 KB Correct.
2 Correct 19 ms 4124 KB Correct.
3 Correct 15 ms 3932 KB Correct.
4 Correct 17 ms 3932 KB Correct.
5 Correct 17 ms 4052 KB Correct.
6 Correct 4 ms 4444 KB Correct.

Subtask #4
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 17 ms 5932 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 4188 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 4188 KB Correct.
2 Correct 16 ms 4188 KB Correct.
3 Correct 31 ms 9308 KB Correct.
4 Correct 12 ms 4700 KB Correct.
5 Incorrect 20 ms 3928 KB Wrong Answer.
6 Halted 0 ms 0 KB -

Subtask #7
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 10 ms 7772 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 11 ms 7772 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -