Submission #14773409
Source Code Expand
/* Author : Pranav Deshmukh
PICT,Pune
Purpose: Atcoder Contest ABC172
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define dip(type,var) type var; cin>>var;
#define dipi(x) int x; cin>>x;
#define w(x) int x; cin>>x; while(x--)
#define mka(arr,n,type) type *arr=new type[n];
#define foi(i,n) for(int i=0;i<n;i++)
#define mod pow(10,9)+7
#define inf 1e18
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
void c_p_c()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int32_t main() {
c_p_c();
dipi(n);
dipi(m);
dipi(k);
int count = 0, p1 = 0, p2 = 0, sum = 0;
int *arr1 = new int[n];
int *arr2 = new int[m];
for (int i = 0; i < n; i++) {
cin >> arr1[i];
}
for (int i = 0; i < m; i++) {
cin >> arr2[i];
}
for (int i = 0; i < n + m; i++) {
int temp;
if (p1 < n - 1 && p2 < m - 1)
temp = min(arr1[p1], arr2[p2]);
if (p1 == n ) {
temp = arr2[p2];
}
if (p2 == m )
temp = arr1[p1];
if (sum + temp > k)
break;
sum = sum + temp;
if (temp == arr1[p1]) {
p1++;
}
else {
p2++;
}
count++;
}
cout << count << endl;
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | C - Tsundoku |
| User | pranav918 |
| Language | C++ (GCC 9.2.1) |
| Score | 0 |
| Code Size | 1879 Byte |
| Status | WA |
| Exec Time | 49 ms |
| Memory | 6764 KiB |
Compile Error
./Main.cpp: In function ‘int32_t main()’:
./Main.cpp:64:17: warning: ‘temp’ may be used uninitialized in this function [-Wmaybe-uninitialized]
64 | if (sum + temp > k)
| ~~~~^~~~~~
Judge Result
| Set Name | Sample | All | ||||||
|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 0 / 300 | ||||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | a01.txt, a02.txt, a03.txt |
| All | a01.txt, a02.txt, a03.txt, b04.txt, b05.txt, b06.txt, b07.txt, b08.txt, b09.txt, b10.txt, b11.txt, b12.txt, b13.txt, b14.txt, b15.txt, b16.txt, b17.txt, b18.txt, b19.txt, b20.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| a01.txt | AC | 6 ms | 3524 KiB |
| a02.txt | AC | 2 ms | 3632 KiB |
| a03.txt | AC | 10 ms | 3588 KiB |
| b04.txt | AC | 3 ms | 3476 KiB |
| b05.txt | AC | 49 ms | 6716 KiB |
| b06.txt | AC | 37 ms | 6716 KiB |
| b07.txt | AC | 2 ms | 3540 KiB |
| b08.txt | WA | 36 ms | 6736 KiB |
| b09.txt | WA | 24 ms | 5104 KiB |
| b10.txt | WA | 25 ms | 5220 KiB |
| b11.txt | WA | 21 ms | 5352 KiB |
| b12.txt | WA | 26 ms | 5888 KiB |
| b13.txt | WA | 42 ms | 6736 KiB |
| b14.txt | WA | 42 ms | 6708 KiB |
| b15.txt | WA | 41 ms | 6732 KiB |
| b16.txt | WA | 42 ms | 6732 KiB |
| b17.txt | WA | 40 ms | 6764 KiB |
| b18.txt | AC | 42 ms | 6668 KiB |
| b19.txt | WA | 41 ms | 6728 KiB |
| b20.txt | AC | 31 ms | 6620 KiB |