oj.uz

Submission #142529

# Submission time Handle Problem Language Result Execution time Memory
142529 2019-08-09T11:15:47 Z cheetose 복사 붙여넣기 2 (JOI15_copypaste2) C++11
100 / 100
 299 ms 8624 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 1987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

int k,m;
char s[200001];
int A[200000],B[200000],C[200000];
int main() {
	scanf("%d%d%s",&k,&m,s);
	int n;
	scanf("%d",&n);
	fup(i,0,n-1,1)scanf("%d%d%d",A+i,B+i,C+i);
	fup(i,0,k-1,1)
	{
		int t=i;
		fdn(i,n-1,0,1)
		{
			if(t<C[i])continue;
			else if(C[i]<=t && t<C[i]+B[i]-A[i])t=A[i]-C[i]+t;
			else t=t-(B[i]-A[i]);
		}
		printf("%c",s[t]);
	}
}

Compilation message

copypaste2.cpp: In function 'int main()':
copypaste2.cpp:67:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%s",&k,&m,s);
  ~~~~~^~~~~~~~~~~~~~~~~~
copypaste2.cpp:69:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
copypaste2.cpp:70:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fup(i,0,n-1,1)scanf("%d%d%d",A+i,B+i,C+i);
                ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 4 ms 380 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct

Subtask #2
90.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 4 ms 380 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 284 ms 8544 KB Output is correct
10 Correct 147 ms 8568 KB Output is correct
11 Correct 161 ms 8620 KB Output is correct
12 Correct 299 ms 8568 KB Output is correct
13 Correct 140 ms 8312 KB Output is correct
14 Correct 150 ms 8444 KB Output is correct
15 Correct 125 ms 8312 KB Output is correct
16 Correct 125 ms 8440 KB Output is correct
17 Correct 255 ms 8372 KB Output is correct
18 Correct 109 ms 8568 KB Output is correct
19 Correct 110 ms 8416 KB Output is correct
20 Correct 111 ms 8412 KB Output is correct
21 Correct 120 ms 8440 KB Output is correct
22 Correct 133 ms 8540 KB Output is correct
23 Correct 145 ms 8444 KB Output is correct
24 Correct 168 ms 8440 KB Output is correct
25 Correct 225 ms 8512 KB Output is correct
26 Correct 287 ms 8624 KB Output is correct