# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
595871 | 2022-07-14T07:48:30 Z | AGE | Sob (COCI19_sob) | C++14 | 367 ms | 8288 KB |
#include<bits/stdc++.h> #define F first #define S second #define pb push_back #define int long long using namespace std; const int N=2e6+10,M=2e3,mod=10; bool vis[N]; main() { int n,m; cin>>n>>m; vector<pair<int,int>>v; int x=ceil(log2(n)); for(int i=m;i<n+m;i++){ bitset<32>bt; int num=0; bt=i; for(int j=0;j<x;j++){ if(bt[j]==1){ num+=(1<<j); if(vis[num]==0){ vis[num]=1; break; } } } if(num==n){ num=0; x--; } v.pb({num,i}); } sort(v.begin(),v.end()); for(int i=0;i<v.size();i++) cout<<v[i].F<<" "<<v[i].S<<endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 440 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 367 ms | 8288 KB | Output is correct |
7 | Correct | 200 ms | 4076 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |