제출 #1286142

#제출 시각아이디문제언어결과실행 시간메모리
1286142Yusif_NazarliArranging Tickets (JOI17_arranging_tickets)C++20
0 / 100
0 ms332 KiB
#include "bits/stdc++.h" #include "ext/pb_ds/assoc_container.hpp" #define int long long #define pii pair<int , int> #define pb push_back #define all(v) v.begin() , v.end() #define S second #define F first using namespace std; using namespace __gnu_pbds; template <typename t> using indexed_set = tree<t , null_type , less<t> , rb_tree_tag , tree_order_statistics_node_update>; void Yusiff(){ int n , m; cin >> n >> m; int a[m] , b[m] , c[m]; int i = 0; while(m--){ cin >> a[i] >> b[i] >> c[i]; i++; } cout << 1; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; // cin >> t; while(t--){ Yusiff(); } } /* 1 5 4 1 4 2 5 3 9 1 10 3 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...