Submission #11355748
Source Code Expand
#include <bits/stdc++.h> #define gcd(m,n) __gcd(m,n) #define lcm(m,n) m*(n/gcd(m,n)) #define fast std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define pi acos(-1.0) #define endl '\n' #define MOD 1000000007 #define ull unsigned long long #define ll long long #define ld long double #define pb push_back #define dbg(x) cout << #x << " " << x << endl; ll power(ll base, ll exp) {ll res=1;while(exp>0) {if(exp%2==1) res=(res*base);base=(base*base);exp/=2;}return res;} ll mod(ll a, ll b) {return (a % b + b) % b;} using namespace std; ll N,M,x,y,wt; vector<pair<ll,ll>> *graph = new vector<pair<ll,ll>>[20000]; ll d[20000]; ll bford() { for(ll i = 0; i < N-1; i++) { for(ll j = 1; j <= N; j++) { for(ll t = 0; t < graph[j].size(); t++) { if(graph[j][t].second + d[j] < d[graph[j][t].first]) { d[graph[j][t].first] = graph[j][t].second+d[j]; } } } } return d[N]; } int main() { for(ll i = 0; i < 1005; i++) { d[i] = 10000000000000; } fast; cin>>N>>M; for(ll i = 0; i < M; i++) { cin>>x>>y>>wt; graph[x].push_back(make_pair(y,-wt)); } d[1] = 0; ll a = bford(); ll b = bford(); if(a == b) cout << -a << endl; else cout << "inf" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Score Attack |
User | benzkeyy |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1280 Byte |
Status | AC |
Exec Time | 11 ms |
Memory | 768 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 2 ms | 768 KB |
sample_02.txt | AC | 1 ms | 768 KB |
sample_03.txt | AC | 2 ms | 768 KB |
subtask_1_1.txt | AC | 2 ms | 768 KB |
subtask_1_10.txt | AC | 2 ms | 768 KB |
subtask_1_11.txt | AC | 2 ms | 768 KB |
subtask_1_12.txt | AC | 6 ms | 768 KB |
subtask_1_13.txt | AC | 4 ms | 768 KB |
subtask_1_14.txt | AC | 6 ms | 768 KB |
subtask_1_15.txt | AC | 11 ms | 768 KB |
subtask_1_16.txt | AC | 2 ms | 768 KB |
subtask_1_17.txt | AC | 2 ms | 768 KB |
subtask_1_18.txt | AC | 5 ms | 768 KB |
subtask_1_19.txt | AC | 9 ms | 768 KB |
subtask_1_2.txt | AC | 5 ms | 768 KB |
subtask_1_20.txt | AC | 4 ms | 768 KB |
subtask_1_21.txt | AC | 6 ms | 768 KB |
subtask_1_22.txt | AC | 11 ms | 768 KB |
subtask_1_23.txt | AC | 2 ms | 768 KB |
subtask_1_24.txt | AC | 6 ms | 768 KB |
subtask_1_25.txt | AC | 3 ms | 768 KB |
subtask_1_26.txt | AC | 6 ms | 768 KB |
subtask_1_27.txt | AC | 6 ms | 768 KB |
subtask_1_3.txt | AC | 4 ms | 768 KB |
subtask_1_4.txt | AC | 5 ms | 768 KB |
subtask_1_5.txt | AC | 3 ms | 768 KB |
subtask_1_6.txt | AC | 7 ms | 768 KB |
subtask_1_7.txt | AC | 5 ms | 768 KB |
subtask_1_8.txt | AC | 5 ms | 768 KB |
subtask_1_9.txt | AC | 2 ms | 768 KB |