結果

問題 No.1382 Travel in Mitaru city
ユーザー null
提出日時 2021-02-07 22:17:34
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 157 ms / 2,000 ms
コード長 4,937 bytes
コンパイル時間 12,059 ms
コンパイル使用メモリ 428,356 KB
最終ジャッジ日時 2025-01-18 14:56:37
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 68
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘void scans(std::string&)’:
main.cpp:76:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   76 |         scanf("%c", &c);
      |         ~~~~~^~~~~~~~~~
main.cpp:77:28: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   77 |         if (c == '\n')scanf("%c", &c);
      |                       ~~~~~^~~~~~~~~~
main.cpp:80:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   80 |                 scanf("%c", &c);
      |                 ~~~~~^~~~~~~~~~
main.cpp: In function ‘void scanc(char&)’:
main.cpp:86:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   86 |         scanf("%c", &c);
      |         ~~~~~^~~~~~~~~~
main.cpp:89:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   89 |                 scanf("%c", &c);
      |                 ~~~~~^~~~~~~~~~
main.cpp: In function ‘int main()’:
main.cpp:201:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  201 |         scanf("%d%d%d%d", &n, &m, &s, &t);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:205:23: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  205 |         rep(i, n)scanf("%d", &p[i]);
      |                  ~~~~~^~~~~~~~~~~~~
main.cpp: In member function ‘void graph<T>::read(int, bool) [with T = int]’:
main.cpp:174:30: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused

ソースコード

diff #
プレゼンテーションモードにする

/*
このコード、と～おれ!
Be accepted!
∧＿∧　
（｡･ω･｡)つ━☆・*。
⊂　　 ノ 　　　・゜+.
　しーＪ　　　°。+ *´¨)
        　　.· ´¸.·*´¨) ¸.·*¨)
          　　　　　　　　　　(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <functional>
#include <complex>
#include <list>
#include <cassert>
#include <iomanip>
#include <set>
#include <stack>
#include <bitset>
#include <array>
#include <chrono>
//#pragma GCC target("arch=skylake-avx512")
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define repeat(i, n, m) for(int i = n; i < (m); ++i)
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printim(a) printf(a ? "possible\n" : "imposible\n")
#define printdb(a) printf("%.50lf\n", a)
#define printLdb(a) printf("%.50Lf\n", a)
#define printdbd(a) printf("%.16lf\n", a)
#define prints(s) printf("%s\n", s.c_str())
#define all(x) (x).begin(), (x).end()
#define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI)
#define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L)
#define Please return
#define AC 0
#define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d))
using ll = long long;
using ull = unsigned long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1e9 + 7;
constexpr ll mod = 998244353;
constexpr long double eps = 1e-6;
const long double PI = acosl(-1.0L);
using namespace std;
void scans(string& str) {
    char c;
    str = "";
    scanf("%c", &c);
    if (c == '\n')scanf("%c", &c);
    while (c != '\n' && c != -1 && c != ' ') {
        str += c;
        scanf("%c", &c);
    }
}
void scanc(char& str) {
    char c;
    scanf("%c", &c);
    if (c == -1)return;
    while (c == '\n') {
        scanf("%c", &c);
    }
    str = c;
}
double acot(double x) {
    return PI / 2 - atan(x);
}
ll LSB(ll n) { return (n & (-n)); }
template<typename T>
inline T chmin(T& a, const T& b) {
    if (a > b)a = b;
    return a;
}
template<typename T>
inline T chmax(T& a, const T& b) {
    if (a < b)a = b;
    return a;
}
//cpp_int
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using namespace boost::multiprecision;
#else
using cpp_int = ll;
#endif
//atcoder library
#if __has_include(<atcoder/all>)
#include <atcoder/all>
//using namespace atcoder;
#endif
/*
    random_device seed_gen;
    mt19937 engine(seed_gen());
    uniform_int_distribution dist(1, 100);
*/
/*----------------------------------------------------------------------------------*/
/*
* @title template(graph)
* @docs kyopro/docs/graph_template.md
*/
template<typename T>
struct edge {
    T cost;
    int from, to;
    edge(int from, int to) : from(from), to(to), cost(T(1)) {}
    edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}
};
template<typename T = int>
struct graph {
    int n;
    bool directed, weighted;
    vector<vector<edge<T>>> g;
    graph(int n, bool directed, bool weighted) : g(n), n(n), directed(directed), weighted(weighted) {}
    void add_edge(int from, int to, T cost = T(1)) {
        g[from].emplace_back(from, to, cost);
        if (not directed) {
            g[to].emplace_back(to, from, cost);
        }
    }
    vector<edge<T>>& operator[](const int& idx) {
        return g[idx];
    }
    void read(int e, bool one_indexed) {
        int a, b, c = 1;
        while (e--) {
            scanf("%d%d", &a, &b);
            if (weighted) {
                scanf("%d", &c);
            }
            if (one_indexed)--a, --b;
            add_edge(a, b, c);
        }
    }
    void read(int e, bool one_indexed, const string& format) {
        int a, b;
        T c = T(1);
        while (e--) {
            scanf("%d%d", &a, &b);
            if (weighted) {
                scanf(format.c_str(), &c);
            }
            if (one_indexed)--a, --b;
            add_edge(a, b, c);
        }
    }
};
int main() {
    int n, m, s, t;
    scanf("%d%d%d%d", &n, &m, &s, &t);
    --s, --t;
    vector<int> p(n), q(n);
    vector<bool> visited(n);
    rep(i, n)scanf("%d", &p[i]);
    q = p;
    graph g(n, false, false);
    g.read(m, true);
    priority_queue<pair<int, int>> que;
    que.push({ q[s], s });
    int ma = 0;
    vector<int> rec;
    while (not que.empty()) {
        auto [c, cur] = que.top();
        que.pop();
        if (visited[cur])continue;
        visited[cur] = true;
        chmin(c, p[cur]);
        rec.push_back(c);
        for (const auto& aa : g[cur]) {
            if (not visited[aa.to])que.push({ min(c, q[aa.to]), aa.to });
        }
    }
    sort(all(rec));
    rec.erase(unique(all(rec)), rec.end());
    printf("%d\n", (int)rec.size() - 1);
    Please AC;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0