Submission #1115184

#TimeUsernameProblemLanguageResultExecution timeMemory
1115184vjudge1Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
0 / 100
272 ms32028 KiB
#include <bits/stdc++.h> #define ll long long #define pb push_back #define pf push_front #define F first #define S second #define all(v) (v).begin(),(v).end() #define int long long using namespace std; const int maxn = 2e5 + 5; const int mod = 1e9 + 7; int n; void webbly_abi_spasibo(){ int m; cin >> n >> m; for(int i = 1; i <= n; i++){ int x; cin >> x; } for(int i = 1; i <= m; i++){ int a,b,c; cin >> a >> b >> c; } cout << "1\n0"; } /* */ signed main(){ // // freopen("greedy.in", "r", stdin); // freopen("greedy.out", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); int tt = 1; //cin >> tt; while(tt--){ webbly_abi_spasibo(); } 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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...