Submission #1348815

#	Time	Username	Problem	Language	Result	Execution time	Memory
1348815		txni128	로봇 (IOI13_robots)	C++20	Compilation error	0 ms	0 KiB

robots

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#pragma GCC optimize("O3" , "Ofast" , "unroll-loops" , "fast-math")

#define endl '\n'
#define X first
#define Y second
#define MOD 1000000007

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector <int> vi;
typedef vector <long long> vll;
typedef vector <unsigned long long> vull;
typedef vector <string> vs;
typedef pair <int, int> pii;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}


const int maxn = 2e5 + 7;
int a, b, t;
int x[maxn];
int y[maxn];
int w[maxn];
int s[maxn];
vector <pii> v1, v2;
int used[maxn];
bool check(int yy)
{
    int p = -1;
    priority_queue <pii> q;
    for(int i = 1;i < a;i++)
    {
        while(p + 1 < a && x[i] >= v1[p + 1].X)
        {
            p++;
            q.push({s[v1[p].Y], v1[p].Y});
        }
        for(int j = 1;j <= yy;j++)
        {
            used[q.top().Y] = 1;
            q.pop();
        }
    }
    priority_queue <pii> q1;
    for(int i = 1;i < b;i++)
    {
        while(p + 1 < b && y[i] >= v2[p + 1].X)
        {
            p++;
            if(used[p] == 1)continue;
            q1.push({w[v2[p].Y], v2[p].Y});
        }
        for(int j = 1;j <= yy;j++)
        {
            used[q1.top().Y] = 1;
            q1.pop();
        }
    }
    for(int i = 1;i <= t;i++)
    {
        if(used[i] == 0)return false;
    }
    return true;
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[])
{
    a = A;
    b = B;
    t = T;
    for(int i = 1;i <= a;i++)
    {
        x[i] = X[i];
    }
    for(int i = 1;i <= b;i++)
    {
        y[i] = Y[i];
    }
    for(int i = 1;i <= t;i++)
    {
        w[i] = W[i];
        s[i] = S[i];
        v1.push_back({w[i], i});
        v2.push_back({s[i], i});
    }
    sort(v1.begin(), v1.end());
    sort(v2.begin(), v2.end());
    sort(x + 1, x + 1 + a);
    sort(y + 1, y + 1 + b);
    int l = 1;
    int r = 1e9;
    int mid;
    while(l <= r)
    {
        mid = (l + r) / 2;
        if(check(mid))r = mid - 1;
        else l = mid + 1;
    }
    if(l > 1e8)cout << -1 << endl;
    else cout << l << endl;
}

Compilation message (stderr)

robots.cpp: In function 'int putaway(int, int, int, int*, int*, int*, int*)':
robots.cpp:111:1: warning: no return statement in function returning non-void [-Wreturn-type]
  111 | }
      | ^
/usr/bin/ld: /tmp/ccHL1v4d.o: in function `main':
grader.c:(.text.startup+0x1a1): undefined reference to `putaway'
collect2: error: ld returned 1 exit status