oj.uz

답안 #496017

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496017 2021-12-20T11:54:35 Z ktkerem Sob (COCI19_sob) C++17
10 / 110
 54 ms 3868 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 vll;
typedef unsigned __int128 uvll;
ll _i=0;
#define ffn(x) _i=x
#define llll pair<ll , ll>
#define stitr set<ll>::iterator
#define fora(y,x) for(ll y=_i;x>y;y++)
#define pb push_back
#define pf push_front
#define debu cout << "hello\n"
#define fi first
#define sec second
#define all(a) a.begin() , a.end()
const ll limit = 1e13 + 7; 
const ll ous=1e5 + 5;
const ll dx[4] = {0 , -1 , 1 , 0} , dy[4] = {1,0,0,-1};
void solve(){
    ll n , m;cin >> n >> m;
    ll z =m+n-1;
    vector<ll> dt;
    //cout << z << "\n";
    ll y = 1;
    for(ll i = 0;28>i;i++ , y*=2){
        //cout << y << "\n";
        dt.pb(y);
    }
    y = dt.size();
    fora(i,n){
        bitset<64> bt;
        fora(i,64){
            bt[i] = 0;
        }
        ll opt = i;
        for(ll j = y-1;0<=j;j--){
            if(opt >= dt[j]){
                bt[j] = 1;
                opt-=dt[j];
            }
        }
        opt= i;
        for(ll j = y-1;0<=j && opt < m;j--){
            if(bt[j] == 0 && (dt[j] + opt) <= z){
                opt+=dt[j];
            }
        }
        cout << i << " " << opt << "\n";
    }
    return;/**/
}
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    ll t=1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0; 
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 54 ms 3868 KB Output is correct

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 54 ms 3868 KB Output is correct
5 Incorrect 1 ms 332 KB Output isn't correct
6 Halted 0 ms 0 KB -