QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#718466#9546. Recover StatisticsMLK2AC ✓0ms3744kbC++141.1kb2024-11-06 20:35:312024-11-06 20:35:33

Judging History

你现在查看的是最新测评结果

  • [2024-11-06 20:35:33]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3744kb
  • [2024-11-06 20:35:31]
  • 提交

answer

#include <bits/stdc++.h>
#define N (200000 + 10)  /*------------------ #define ------------------*/
#define M (400000 + 10)
#define MOD (1000000000 + 7)
//#define MOD (998244353)
#define INF (0x3f3f3f3f)
#define LNF (3e18)
#define mod(a,b) (((a)%(b)+(b))%(b))
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<int,LL> PIL;
typedef pair<LL,int> PLI;
typedef pair<double,double> PDD;

auto solve(){
	
	LL a,b,c;
	cin >> a >> b >> c;
	
	vector<LL> ans;
	for(int i = 0;i < 50;i ++ ) ans.push_back(1);
	for(int i = 0;i < 45;i ++ ) ans.push_back(a + 1);
	for(int i = 0;i < 4;i ++ ) ans.push_back(b + 1);
	for(int i = 0;i < 1;i ++ ) ans.push_back(c + 1);
	
	cout << (int)ans.size() << '\n';
	for(LL v : ans) cout << v << ' ';
	cout << '\n';
}

signed main(){
	IOS
	int T = 1;
	//cin >> T;
	while(T -- ) solve();
	//while(T -- ) cout << (solve() ? "YES" : "NO") << '\n';

    return 0;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3520kb

input:

50
95
99

output:

100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 96 96 96 96 100 

result:

ok ok

Test #2:

score: 0
Accepted
time: 0ms
memory: 3532kb

input:

1
2
3

output:

100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 4 

result:

ok ok

Test #3:

score: 0
Accepted
time: 0ms
memory: 3744kb

input:

1
999999998
999999999

output:

100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 999999999 999999999 999999999 999999999 1000000000 

result:

ok ok

Test #4:

score: 0
Accepted
time: 0ms
memory: 3536kb

input:

999999997
999999998
999999999

output:

100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999...

result:

ok ok

Test #5:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

893
114514
1919810

output:

100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 894 114515 114515 11...

result:

ok ok

Extra Test:

score: 0
Extra Test Passed