Submission #1305604

#TimeUsernameProblemLanguageResultExecution timeMemory
1305604thesentroStranded Far From Home (BOI22_island)C++20
0 / 100
1 ms572 KiB
/* _____ _ ____ _ |_ _| |__ ___/ ___| ___ _ __ | |_ _ __ ___ | | | '_ \ / _ \___ \ / _ \ '_ \| __| '__/ _ \ | | | | | | __/___) | __/ | | | |_| | | (_) | |_| |_| |_|\___|____/ \___|_| |_|\__|_| \___/ */ #include <bits/stdc++.h> #pragma GCC optimize("O3") using namespace std; #define ll long long ll mod = 1e9+7; //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ll binpow(ll a, ll b) { ll res = 1; while (b>0) { if (b&1) res = (res*a)%mod; a = (a*a)%mod; b>>=1; } return res; } ll gcd(ll x, ll y) { if (y==0) return x; return gcd(y, x%y); } void solve() { ll n,m; cin>>n>>m; vector<ll>v(n+1); for (int i=1 ; i<=n ;i++) cin>>v[i]; vector<ll>res(n+1, 0); for (int i=1 ; i<=m ;i++) { ll x,y; cin>>x>>y; } cout<<0; for (int i=1 ; i<=n-1 ; i++) cout<<1; } int main() { ll tt = 1; // cin>>tt; while (tt--) { solve(); } 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...