QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #718073 | #9546. Recover Statistics | CodeChild# | WA | 0ms | 3644kb | C++20 | 1.3kb | 2024-11-06 19:38:02 | 2024-11-06 19:38:03 |
Judging History
answer
#include <iostream>
#include <cstring>
#include <queue>
#include <map>
#include <cstdio>
#include <unordered_map>
#include <deque>
#include <iomanip>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stack>
#include <set>
#include <array>
#include <bitset>
#include <limits.h>
#include <numeric>
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef long long ll ;
typedef pair<int,int> PII;
typedef pair<int,LL> PIL;
typedef pair<int ,PII> PIII ;
typedef pair<int, pair<PII ,int > > PIIII;
typedef pair<LL , LL> PLL ;
typedef pair<LL ,int > PLI ;
typedef pair<int,char > PIC ;
typedef unsigned long long ULL ;
const int N = 5e5+10,M = 4e5+10 ;
const LL mod = 1e9+7 , INF = 1e18+10;
const int inf = 1e8 ;
const double eps = 1e-7 ;
const ULL P= 131 ;
LL n , m , k ;
void solve( ) {
cin >> n >> m >> k ;
cout << 100 << '\n';
for(int i = 1 ; i <= n ; ++ i ) cout << 1 <<" " ;
for(int i = n + 1 ; i <= m ; ++ i ) cout << n + 1 << " " ;
for(int i = m + 1 ; i <= k ; ++ i ) cout << m + 1 <<" " ;
for(int i = k + 1 ; i <= 100 ; ++ i ) cout << 100 <<" " ;
}
int main(){
ios::sync_with_stdio(false);
cin.tie( 0 ) ; cout.tie(0) ;
int T = 1 ;
// cin >> T ;
while(T-- ){
solve() ;
}
return 0 ;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3644kb
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: -100
Wrong Answer
time: 0ms
memory: 3576kb
input:
1 2 3
output:
100 1 2 3 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 10...
result:
wrong answer wrong p50: 1 / 100