# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520870 | YeoBL | Telefoni (COCI17_telefoni) | C++14 | 21 ms | 984 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("Ofast") //only when desperate
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") // only when desperate
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define FOR(a,b,i) for (int i=a;i!=b;a>b?i--:i++)
#define F0R(a,i) FOR(0,a,i)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define allr(a) (a), (a)+sizeof(a)/sizeof(a[0])
#define sq(a) (a)*(a)
#define tri(x) (x)*((x)+1)/2
#define ll long long
#define endl '\n'
#define INF 1e9+5
#define LINF 1e18+5
#define read(x) cin >> x;
#define read2(x,y) cin >> x >> y;
#define read3(x,y,z) cin >> x >> y >> z;
#define read4(w,x,y,z) cin >> w >> x >> y >> z;
#define show(x) cerr << #x << " is " << x << endl;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |