Submission #1286208
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define FOR(i, n) for(int i = 0; i < (n); i++) #define MEM(a, x) memset(a, x, sizeof(a)) #define ALL(a) a.begin(), a.end() #define UNIQUE(a) a.erase(unique(ALL(a)), a.end()) typedef long long ll; typedef pair<int, ll> P; int n, m; vector<P> g[1005]; vector<P> v[1005]; bool used[2005]; ll ma[1005]; void dfs(int s, ll c) { FOR(i, g[s].size()) { P t = g[s][i]; ma[t.first] = max(ma[t.first], c + t.second); dfs(t.first, c + t.second); } } bool check(int s) { FOR(i, v[s].size()) { P t = v[s][i]; if (used[t.second]) return false; used[t.second] = true; return check(t.first); } return true; } int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(false); cin >> n >> m; FOR(i, m) { int a, b; ll c; cin >> a >> b >> c; a--; b--; g[a].push_back(P(b, c)); v[a].push_back(P(b, i)); } if (!check(0)) { cout << "inf" << endl; return 0; } fill(ma, ma + n, -100000000000000); ma[0] = 0; dfs(0, 0); cout << ma[n-1] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Score Attack |
User | moguta |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1092 Byte |
Status | RE |
Exec Time | 272 ms |
Memory | 262528 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_1.txt | AC | 1 ms | 384 KB |
subtask_1_10.txt | AC | 1 ms | 384 KB |
subtask_1_11.txt | RE | 256 ms | 262528 KB |
subtask_1_12.txt | RE | 251 ms | 262528 KB |
subtask_1_13.txt | AC | 1 ms | 256 KB |
subtask_1_14.txt | RE | 264 ms | 262528 KB |
subtask_1_15.txt | AC | 2 ms | 384 KB |
subtask_1_16.txt | WA | 1 ms | 256 KB |
subtask_1_17.txt | WA | 1 ms | 384 KB |
subtask_1_18.txt | WA | 2 ms | 384 KB |
subtask_1_19.txt | RE | 257 ms | 262528 KB |
subtask_1_2.txt | AC | 2 ms | 384 KB |
subtask_1_20.txt | AC | 1 ms | 384 KB |
subtask_1_21.txt | RE | 245 ms | 262528 KB |
subtask_1_22.txt | RE | 272 ms | 262528 KB |
subtask_1_23.txt | WA | 1 ms | 256 KB |
subtask_1_24.txt | WA | 2 ms | 384 KB |
subtask_1_25.txt | WA | 1 ms | 384 KB |
subtask_1_26.txt | RE | 257 ms | 262528 KB |
subtask_1_27.txt | RE | 256 ms | 262528 KB |
subtask_1_3.txt | AC | 1 ms | 384 KB |
subtask_1_4.txt | AC | 2 ms | 384 KB |
subtask_1_5.txt | AC | 1 ms | 384 KB |
subtask_1_6.txt | AC | 2 ms | 384 KB |
subtask_1_7.txt | WA | 2 ms | 384 KB |
subtask_1_8.txt | WA | 2 ms | 384 KB |
subtask_1_9.txt | AC | 1 ms | 256 KB |