ACM Plan UVa - 1237 Expert Enough?

#include <bits/stdc++.h>
using namespace std;
struct range
{
    int f, c;
    char n[21];
    range();
    range(char* s, int a, int b)
    {
        f = a;
        c = b;
        strcpy(n, s);
    }
};
vector<range> v;
char* query(int x)
{
    char *s = (char*)malloc(21 * sizeof(char));
    int i, j, limit = v.size();
    for(i = 0; i < limit; i++)
    {
        if(x >= v[i].f && x <= v[i].c)
        {
            strcpy(s, v[i].n);
            break;
        }
    }
    if(i == v.size()) return strcpy(s, "UNDETERMINED");
    for(j = i + 1; j < limit; j++)
    {
        if(x >= v[j].f && x <= v[j].c)
        {
            strcpy(s, "UNDETERMINED");
            break;
        }
    }
    return s;
}
int main()
{
    int t, d, q, f, c, x;
    char s[21];
    scanf("%d", &t);
    while(t--)
    {
    	v.clear();
    	scanf("%d", &d); getchar();
    	while(d--)
    	{
    	    scanf("%s%d%d", s, &f, &c);
    	    v.push_back(range(s, f, c));
    	}

	scanf("%d", &q);
	while(q--)
	{
	    scanf("%d", &x);
	    puts(query(x));
	}
	if(t) putchar('\n');
    }
    return 0;
}