# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1095985 | phamducluong | Snake Escaping (JOI18_snake_escaping) | C++14 | 445 ms | 43248 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>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
//typedef tree<int,null_type,less_equal<int>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define Sakura_chan ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mem(a,x) memset(a,x,sizeof(a))
#define fast(s) s.reserve(2000); s.max_load_factor(0.5);
#define ll long long
#define F first
#define S second
#define pb push_back
#define ins insert
#define pii pair <long long, long long>
#define vpii vector <pii>
#define sz size()
#define all(p) p.begin(), p.end()
#define For(i,a,b) for(int i=a; i<=b; ++i)
#define rFor(i,a,b) for(int i=a; i>=b; --i)
#define Auto(it,a) for(auto it: a)
const int mod=1e9+7;
const int N=1e6+5, M=20;
int n, q, f[1<<M], g[1<<M], cnt[1<<M];
string s, t;
void file()
{
#define task "snakes"
if(fopen(task".inp","r"))
{
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |