結果
問題 | No.2403 "Eight" Bridges of Königsberg |
ユーザー | mikam |
提出日時 | 2023-08-04 21:44:30 |
言語 | C++17(clang) (17.0.6 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,062 bytes |
コンパイル時間 | 8,053 ms |
コンパイル使用メモリ | 237,720 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-14 19:42:10 |
合計ジャッジ時間 | 9,324 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 15 ms
5,248 KB |
testcase_05 | AC | 29 ms
5,248 KB |
testcase_06 | AC | 32 ms
5,248 KB |
testcase_07 | AC | 18 ms
5,248 KB |
testcase_08 | AC | 22 ms
5,248 KB |
testcase_09 | AC | 33 ms
5,248 KB |
testcase_10 | AC | 31 ms
5,248 KB |
testcase_11 | AC | 24 ms
5,248 KB |
testcase_12 | AC | 33 ms
5,248 KB |
testcase_13 | AC | 23 ms
5,248 KB |
testcase_14 | WA | - |
testcase_15 | AC | 1 ms
5,248 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 7 ms
5,760 KB |
testcase_20 | AC | 3 ms
5,248 KB |
testcase_21 | AC | 4 ms
5,248 KB |
testcase_22 | AC | 6 ms
5,504 KB |
testcase_23 | AC | 6 ms
5,376 KB |
testcase_24 | AC | 5 ms
5,248 KB |
testcase_25 | AC | 5 ms
5,248 KB |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 6 ms
5,248 KB |
testcase_29 | WA | - |
testcase_30 | AC | 4 ms
5,248 KB |
testcase_31 | AC | 7 ms
5,760 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
コンパイルメッセージ
main.cpp:40:79: warning: expression result unused [-Wunused-value] 40 | template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;} | ^~~~ main.cpp:87:14: note: in instantiation of function template specialization 'print<int>' requested here 87 | if(-m!=p)print(-1); | ^ 1 warning generated.
ソースコード
#include <atcoder/all> using namespace atcoder; #include <bits/stdc++.h> using namespace std; #include <boost/multiprecision/cpp_int.hpp> #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++) #define all(v) v.begin(),v.end() #define inc(x,l,r) ((l)<=(x)&&(x)<(r)) #define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end()) #define pcnt __builtin_popcountll typedef long long ll; #define int ll using ld = long double; using vi = vector<int>; using vs = vector<string>; using P = pair<int,int>; using vp = vector<P>; using Bint = boost::multiprecision::cpp_int; template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; } template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; } template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>; template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;} ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;} istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;} ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;} istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;} template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;} template<class... T> void input(T&... a){(cin>> ... >> a);} #ifdef LOCAL template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;} template<class T> int print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";return 0;} template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";return 0;} #else template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;} template<class T> int print(T& a){cout << a<< '\n';return 0;} template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;} #endif #define VI(v,n) vi v(n); input(v) #define INT(...) int __VA_ARGS__; input(__VA_ARGS__) #define STR(...) string __VA_ARGS__; input(__VA_ARGS__) #define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__) int sign(ll x){return x>0?1:x<0?-1:0;} ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));} ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);} ll abs(ll x,ll y){return abs(x-y);} ll bit(int n){return 1ll<<n;} template<class T> bool ins(string s,T t){return s.find(t)!=string::npos;} P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};} P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};} int yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;return 0;} int YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;return 0;} int di[]={-1,0,1,0,-1,-1,1,1}; int dj[]={0,1,0,-1,-1,1,-1,1}; const ll INF = 8e18; //using mint = modint1000000007; //using mint = modint998244353; //mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;} signed main() { cin.tie(0); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); INT(n,m_); vi deg(n); rep(i,m_){ INT(u,v); --u;--v; deg[v]++; deg[u]--; } sort(all(deg)); // -1,0,0...,1 vi g(n); g[0] = -1; g[n-1] = 1; int m=0,p=0; rep(i,n){ int d = g[i]-deg[i]; if(d<0)m+=d; if(d>0)p+=d; } if(-m!=p)print(-1); else print(p); return 0; }