#1022102 (C++23) No.690 E869120 and Constructing Array 4

• 問題: No.690 E869120 and Constructing Array 4
• ユーザー: vjudge1
• 提出日時: 2024-10-24 15:12:39
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 3 ms / 1,000 ms
• コード長: 2,245 bytes
• コンパイル時間: 2,033 ms
• コンパイル使用メモリ: 164,836 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-10-24 15:12:42
• 合計ジャッジ時間: 3,518 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 19

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
#include <assert.h>
#include <ctype.h>
#include <errno.h>
#include <float.h>
#include <limits.h>
#include <locale.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <wchar.h>
#include <wctype.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <list>
#include <map>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <random>
#include <complex.h>
#include <fenv.h>
#include <inttypes.h>
#include <stdbool.h>
#include <stdint.h>
#include <tgmath.h>
#include <forward_list>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn=1e3+7;
int vis[maxn][maxn];
vector<int> a,b;
int main()
{
    cin.tie(0);
    cout.tie(0);
    std::ios::sync_with_stdio(false);
//  FILE *fsd=fopen("seed.txt","r");
//  unsigned int sd,mhm578;
//  fscanf(fsd,"%u%u",&sd,&mhm578);
//  FILE *gsd=fopen("seed.txt","w");
//  sd+=114514,mhm578+=1;
//  fprintf(gsd,"%u\n%u\n",sd,mhm578);
//  mt19937 rnd(time(0)+sd);
//  freopen("wander.in","r",stdin);
//  freopen("wander.out","w",stdout);
    ll n;
    cin>>n;
    ll num;
    for(ll i=0ll;;i++)
        if((1ll<<i)>n)
        {
            num=i+1;
            break;
        }
    ll dian=num+1ll;
//  cout<<dian<<" ";
    ll bian=(dian)*(dian-1ll)/(2ll);
    ll d=(1ll<<(num-1ll))-n;
//  cout<<bian<<"\n";
//  cout<<d<<"\n";
    if(d==0ll)
    {
        cout<<dian<<" "<<bian<<"\n";
        for(ll i=1ll;i<dian;i++)
            for(ll j=i+1ll;j<=dian;j++)
                cout<<i<<" "<<j<<"\n";
        return 0;
    }
    for(ll i=num;i>=0;i--)
    {
        ll p=(1ll<<i);
        if(d>=p)
        {
            d-=p;
            vis[2+i][dian]=1;
            bian--;
        }
    }
    cout<<dian<<" "<<bian<<"\n";
    for(int i=1ll;i<dian;i++)
        for(int j=i+1ll;j<=dian;j++)
            if(vis[i][j]==0)
                cout<<i<<" "<<j<<"\n";
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX