제출 #1040538

#제출 시각아이디문제언어결과실행 시간메모리
1040538Muhammet여행하는 상인 (APIO17_merchant)C++17
0 / 100
10 ms7772 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long int #define sz(x) (int)x.size() #define ff first #define ss second const ll N = 305; const ll M = 1e9 + 7; int T, n, m, k, b[N][N*10], s[N][N*10]; vector <pair<int,int>> v[N]; int main(){ ios::sync_with_stdio(false); cin.tie(0); cin >> n >> m >> k; for(int i = 1; i <= n; i++){ for(int j = 1; j <= k; j++){ cin >> b[i][j] >> s[i][j]; } } for(int i = 1; i <= m; i++){ int u1, u2, u3; cin >> u1 >> u2 >> u3; v[u1].push_back({u2,u3}); v[u2].push_back({u1,u3}); } cout << 0; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...